SRM_172_Div2_250

#include <iostream>
#include <cstdio>
#include <algorithm>
#include <cstring>
#include <string>
#include <cctype>
#include <stack>
#include <bitset>
#include <queue>
#include <list>
#include <vector>
#include <map>
#include <set>
#include <iterator>
#include <sstream>
#include <stdlib.h>
#include <cmath>
#define FOR(i,A) for(typeof (A).begin() i = (A).begin() ; i != (A).end() ; i++)
#define debug( x ) cout << #x << " = " << x << endl
#define clr(v,x) memset( v, x , sizeof v )
#define all(x) (x).begin() , (x).end()
#define rall(x) (x).rbegin() , (x).rend()
#define TAM 110

using namespace std;

typedef pair<int,int> ii ;
typedef long long ll ;
typedef long double ld ;
typedef pair<int,ii> pii ;
vector<int> v;int el;
int main() {
    int t,n,aux;
    scanf("%d",&t);vector<ii>rpta;
    while(t--){
        scanf("%d",&n);
        for(int i=0;i<n;i++){scanf("%d",&aux);v.push_back(aux);}
        scanf("%d",&el);/*entero elegido*/
        for(int i=0;i<v.size();i++){
            ii str;str.first=abs(v[i]-el);
            str.second=(-1)*v[i];
            rpta.push_back(str);
        }
        sort(all(rpta));/*all definido arriba*/
        vector<int> fn;
        fn.push_back(-1*(rpta[0].second));
        fn.push_back(-1*(rpta[1].second));
        sort(all(fn));
        printf("2\n");
        for(int i=0;i<2;i++){
            printf("%d\n",fn[i]);
        }
        v.clear();rpta.clear();
    }
    return 0;
}