#include <bits/stdc++.h>
using namespace std ;

#define ff    first
#define ss    second
#define pb    push_back

typedef long long    ll;
typedef pair<ll,int>    ii;
typedef long double    lf;


mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());

const ll SQ = 320;
const ll N = 2e5+5;
const ll mod = 998244353;
const ll oo = 1e14+5;

bitset<N> bt[40002];

int powmod (int a, int b, int p) {
    int res = 1;
    while (b)
        if (b & 1)
            res = int (res * 1ll * a % p),  --b;
        else
            a = int (a * 1ll * a % p),  b >>= 1;
    return res;
}

int generator (int p) {
    vector<int> fact;
    int phi = p-1,  n = phi;
    for (int i=2; i*i<=n; ++i)
        if (n % i == 0) {
            fact.push_back (i);
            while (n % i == 0)
                n /= i;
        }
    if (n > 1)
        fact.push_back (n);

    for (int res=2; res<=p; ++res) {
        bool ok = true;
        for (size_t i=0; i<fact.size() && ok; ++i)
            ok &= powmod (res, phi / fact[i], p) != 1;
        if (ok)  return res;
    }
    return -1;
}


int main(){
  #ifdef LOCAL
  freopen("input.txt","r",stdin);
  #endif // LOCAL
  ios_base::sync_with_stdio(0);
  cin.tie(0);cout.tie(0);

  int t; cin >> t;
  while (t--) {
    int n, p; cin >> n >> p;
    int c = generator(p);

    vector <int> a(n);
    vector <int> ap(p);
    for (auto &e : a) cin >> e, ap[e] = 1;
    sort(a.begin(), a.end());

    if (a[0] == 0) {
      if (n == 1) {
        cout << p << " 1\n";
        for (int i = 0; i < p; ++i) cout << i << ' ';
        cout << '\n';
      }
      else {
        vector <int> seq;
        int curre = 1;
        for (int i = 0; i < p - 1; ++i) seq.pb(curre), curre = (curre * c) % p;


        int ya = 0;
        vector <int> ans;
        bitset<N> curr;
        curr.set();
        for (int j = 0; j < 5 && !ya; ++j) {
          int L = j * 40000 + 1, R = (j + 1) * 40000;
          bitset<N> up, down;
          for (int i = 0; i < p - 1; ++i) {
            if (ap[seq[i]]) down[p-1-i]=1;
          }
          for (int i = 0; i < p - 1; ++i) {
  //          cout << seq[i]<<'\n';
            if (ap[seq[i]]) {
              down[p-1]=0;
              up[0]=1;
            }
            if (L <= seq[i] && seq[i] <= R)
              bt[seq[i]-L] = up|down;

            up<<=1;
            down<<=1;
  //          for (int j = 0; j < p; ++j) {
  //            if (bt[seq[i]][j]==1)cout<<1;
  //            else cout<<0;
  //          }
  //          cout<<'\n';
          }
          for (int i = 0; i <= R-L; ++i) {
            if ((curr & bt[i]).any()) {
              curr &= bt[i];
            }
            else {
              cout << curr.count() << ' ' << i+L << '\n';
              for (int j = 0; j < p; ++j) {
                if (curr[j] == 1) ans.pb(seq[j]);
              }
              sort(ans.begin(), ans.end());
              for (auto &e : ans) cout << e << ' ';

              cout << '\n';
              ya = 1;
              break;
            }
  //          cout << i << endl;
          }
        }
      }
    }
    else {
      cout << "1 1\n0\n";
    }
  }
}