#include <bits/stdc++.h>
using namespace std;
#define ff first
#define ss second
#define pb push_back
#define ll long long
typedef pair<int,int> pii;

int mod=1000000+7;
inline int add(int x,int y){int ret=x+y;if(ret>=mod)ret-=mod;return ret;}
inline int sub(int x,int y){int ret=x-y;if(ret<0)ret+=mod;return ret;}
inline int mul(int x,int y){return ((ll)x*y)%mod;}
inline int step(int base,int pw){int ret=1;while(pw){if(pw&1)ret=mul(ret,base);base=mul(base,base);pw>>=1;}return ret;}
inline int invv(int x){return step(x,mod-2);}

const int maxn=(1<<20);

using cd=complex<double>;
const double PI=acos(-1);
cd prekw[maxn];

int g,a[maxn],n,mp[maxn],b[maxn],c[maxn];
void prek(){
    for(int i=2;i<maxn;i++){
        if(mp[i])continue;
        for(int j=i;j<maxn;j+=i){
            if(!mp[j])mp[j]=i;
        }
    }

    double angle;
    for(int i=0;i<maxn;i++){
        angle=((2*PI)/(double)maxn)*(double)i;
        prekw[i]=cd(cos(angle),sin(angle));
        ///cout<<prekw[i].real()<<" "<<prekw[i].imag()<<" "<<angle<<" "<<PI<<" AAA"<<endl;
    }

}
vector<int> factorise(int n){

    vector<int>ret;
    while(n>1){
        if(ret.size()==0)ret.pb(mp[n]);
        else if(ret.back()!=mp[n])ret.pb(mp[n]);
        n/=mp[n];
    }
    return ret;
}
int get_gen(int p){

    if(p==2)return 1;

    p--;

    vector<int>fact=factorise(p);

    for(int i=1;i<=p;i++){

        int e=1;
        for(int j=0;j<fact.size();j++){
            if(step(i,p/fact[j])==1){
                e=0;break;
            }
        }

        if(e)return i;
    }

    return -1;
}

void fft(vector<cd>&a,bool invert){

    int n=a.size();
    int j=0;
    for(int i=1;i<n;i++){

        int bit=n>>1;
        for(;bit&j;bit>>=1)j^=bit;
        j^=bit;

        if(i<j)swap(a[i],a[j]);
    }

    for(int len=2;len<=n;len<<=1){

        int hlen=(len>>1);
        for(int i=0;i<n;i+=len){

            int currw=0;
            int d=maxn/len;
            if(invert)d=maxn-d;

            for(int j=0;j<hlen;j++){

                cd pom1=a[i+j];
                cd pom2=a[i+j+hlen]*prekw[currw];

                a[i+j]=pom1+pom2;
                a[i+j+hlen]=pom1-pom2;

                currw+=d;
                if(currw>=maxn)currw-=maxn;
            }
        }

    }

    if(invert){
        for(int i=0;i<n;i++)a[i]/=n;
    }

}
vector<cd>resetfb;
int resetb=0;
vector<int> pol_mul(vector<int>a,vector<int>b){

    int n=1;
    while(n<a.size()+b.size()-1)n<<=1;

    a.resize(n);
    b.resize(n);
    vector<cd>fa(n),fb(n);
    for(int i=0;i<n;i++)fa[i].real(a[i]);
    for(int i=0;i<n;i++)fb[i].real(b[i]);

    fft(fa,0);
    fft(fb,0);
    /*if(resetb){
        fft(fb,0);
        resetfb=fb;
        resetb=0;
    }
    else fb=resetfb;*/
    //for(int i=0;i<n;i++)
        //cout<<fa[i].real()<<" "<<fa[i].imag()<<" "<<prekw[(maxn/n) *i].real()<<" "<<prekw[(maxn/n)*i].imag()<<endl;
        //cout<<"  OPA"<<endl;
    for(int i=0;i<n;i++)fa[i]*=fb[i];
    fft(fa,1);


    vector<int>ret(n);
    for(int i=0;i<n;i++){
        ///cout<<fa[i].real()<<" "<<fa[i].imag()<<endl;
        ret[i]=round(fa[i].real());
    }
    return ret;
}
vector<int>burt(vector<int>a,vector<int>b){

    vector<int>ret(a.size()+b.size()-1);
    for(int i=0;i<a.size();i++){
        for(int j=0;j<b.size();j++){
            ret[i+j]+=a[i]*b[j];
        }
    }
    return ret;
}

void ispis(vector<int>a){
    for(int i=0;i<a.size();i++)printf("%d ",a[i]);
    printf(" ISPIS \n");
}

vector<int> va,vb;
vector<int> check(int x){

    va.clear();
    va.resize(2*mod-2);

    int cn=mod-1;

    for(int i=0;i<va.size();i++){
        if( b[i%cn]<=x )va[i]=1;
        else va[i]=0;
    }

   // printf("%d XXX\n",x);
   // ispis(va);

    vector<int>ret=pol_mul(va,vb);
    //vector<int>bla=burt(va,vb);

   // ispis(ret);
    //ispis(bla);

    vector<int>rr;
    for(int i=0;i<cn;i++){
        ///printf()
        if(ret[i+cn-1]==x)rr.pb(b[i]);
    }

    return rr;
}

int main() {

    prek();

    /*vector<int>bb,aa;
    aa.pb(1);
    aa.pb(1);
    bb.pb(2);
    bb.pb(3);
    aa=pol_mul(aa,bb);
    ispis(aa);*/


    ///freopen("test.txt","r",stdin);

    int t;
    scanf("%d",&t);
    while(t--){

        scanf("%d %d",&n,&mod);

        resetb=1;

        int e=0;
        for(int i=1;i<=n;i++){
            scanf("%d",&a[i]);
            if(a[i]==0){
                e=1;
                n--;
                i--;
            }
        }

        if(!e){
            printf("%d %d\n0\n",1,1);
            continue;
        }

        g=get_gen(mod);

        /// ako je mex==0 onda dodaj i 0 u rez

        //printf("%d  GEN\n",g);

        int curr=1;
        for(int i=0;i<mod-1;i++){
            b[i]=curr;
            c[curr]=i;
            //printf("%d %d  BC\n",i,curr);
            curr=mul(curr,g);
        }

        vb.clear();
        vb.resize(mod-1);
        for(int i=1;i<=n;i++){
            vb[c[a[i]]]=1;
        }
        //ispis(vb);
        reverse(vb.begin(),vb.end());

        int l=1;
        int r=mod-1;
        int sr,ret=-1;
        while(l<=r){
            sr=(l+r)/2;

            vector<int>pom=check(sr);

            if(pom.size()==0){
                r=sr-1;
            }
            else{
                l=sr+1;
                ret=sr;
            }
        }
        vector<int>rr=check(ret);
        ret++;
        if(ret==0)rr.pb(0);

        printf("%d %d\n",rr.size(),ret);
        sort(rr.begin(),rr.end());
        for(int i=0;i<rr.size();i++)printf("%d ",rr[i]);
        printf("\n");

    }

    return 0;
}