#include<bits/stdc++.h>
#define N 200005
using namespace std;
int T,n,p,a[N];
int id[N],invid[N];
int vis[N];
int gen(){
    for(int i=2;i<p;++i){
        for(int j=0;j<p;++j) vis[j]=0;
        int val=1;
        bool fl=0;
        for(int j=1;j<p;++j){
            if(vis[val]){
                fl=1;
                break;
            }
            vis[val]=1;
            val=1ll*val*i%p;
        }
        if(fl==0) return i;
    }
}
bitset<400000> b,ans,c;
int main(){
    ios::sync_with_stdio(0);
    cin.tie(0);
    cin>>T;
    while(T--){
        cin>>n>>p;
        int g=gen();
        // cerr<<"g:"<<p<<" "<<g<<endl;
        int val=1;
        for(int i=1;i<=p-1;++i){
            id[val]=i;
            invid[i]=val;
            val=1ll*val*g%p;
        }
        bool fl=0,fl2=0;
        for(int i=1;i<=n;++i){
            cin>>a[i];
            if(a[i]==0) fl=1;
            else fl2=1;
        }
        if(fl==0){
            cout<<"1 1\n";
            cout<<"0\n";
            continue;
        }
        if(fl2==0){
            cout<<p<<" 1\n";
            for(int i=0;i<p;++i)
                cout<<i<<" \n"[i==p-1];
            continue;
        }
        b.reset();
        for(int i=1;i<=n;++i) if(a[i]!=0){
            b.set((p-1)-id[a[i]]+1),b.set(2*(p-1)-id[a[i]]+1);
            // cerr<<(p-1)-id[a[i]]+1<<" "<<2*(p-1)-id[a[i]]+1<<endl;
        }
        for(int i=1;i<p;++i) ans.set(i);
        fl=0;
        for(int i=1;i<p;++i){
            c=b>>((p-1)-id[i]+1);
            // cerr<<(p-1)-id[i]+1<<" "<<2*(p-1)-id[i]+1<<endl;
            if((c&ans).count()){
                ans=c&ans;
            }else{
                // cout<<"ans ";
                cout<<ans.count()<<" "<<i<<'\n';
                vector<int> a;
                a.clear();
                for(int j=1;j<p;++j)
                    if(ans[j])
                        a.push_back(invid[j%(p-1)+1]);
                sort(a.begin(),a.end());
                for(auto val:a) cout<<val<<" ";
                cout<<'\n';
                fl=1;
                break;
            }
        }
        if(fl==0){
            cout<<ans.count()<<" "<<p<<'\n';
            vector<int> a;
            a.clear();
            for(int j=1;j<p;++j)
                if(ans[j])
                    a.push_back(invid[j%(p-1)+1]);
            sort(a.begin(),a.end());
            for(auto val:a) cout<<val<<" ";
            cout<<'\n';
        }
    }
    return 0;
}