#include <bits/stdc++.h>

using namespace std;

typedef long double ldb;
typedef long long i64;
typedef unsigned long long u64;
typedef unsigned int u32;
typedef pair<int, int> pii;

// std::mt19937_64 rng(std::chrono::steady_clock::now().time_since_epoch().count());
// priority_queue<int, vector<int>, greater<int>> minq;
// ios::sync_with_stdio(0);cin.tie(0);cout.tie(0);
// fflush(stdout);

const int inf = 1000000007;
const i64 prm = 998244353;
const i64 inf2 = ((i64)inf) * inf;
const int maxn = 1100010; // 1.1e6

inline int read(){
  int x=0,f=0; char ch=getchar();
  while(!isdigit(ch)) f|=(ch==45),ch=getchar();
  while(isdigit(ch)) x=(x<<3)+(x<<1)+(ch^48),ch=getchar();
  return f?-x:x;
}

void once() {
  int n = read();
  static int h, vis[55];
  h++;
  int k = read();
  for (int i = 0; i < k; ++i) {
    int p = read();
    vis[p] = h;
  }
  printf("%d ", n);
  if (n & 1) {
    printf("%d\n", n-k);
    for (int i = 1; i <= n; ++i) if (vis[i] != h) {
      printf("%d ", i);
    }
    puts("");
  } else {
    printf("%d\n", (vis[1] == h) + (n-1 - (k-vis[1]==h)));
    if (vis[1] == h) {
      printf("1");
    }
    for (int i = 2; i <= n; ++i) if (vis[i] != h) {
      printf(" %d", i);
    }
    puts("");
  }
}

int main() {
  int tes = 1;
  tes = read();
  while (tes--) {
    once();
  }
  return 0;
}