#include<bits/stdc++.h>

using namespace std;

#define gc c=getchar()
#define ll long long

template<typename T>
inline void read(T &x){
    x=0;T k=1;char gc;
    while(!isdigit(c)){if(c=='-')k=-1;gc;}
    while(isdigit(c)){x=x*10+c-'0';gc;}x*=k;
}

struct comp{
	double r,i;
	comp():r(0),i(0){}
	comp(const double &_r,const double &_i):r(_r),i(_i){}
};

inline comp operator + (const comp &a,const comp &b){
	return comp(a.r+b.r,a.i+b.i);
}

inline comp operator - (const comp &a,const comp &b){
	return comp(a.r-b.r,a.i-b.i);
}

inline comp operator * (const comp &a,const comp &b){
	return comp(a.r*b.r-a.i*b.i,a.r*b.i+a.i*b.r);
}

inline comp operator / (const comp &a,const double &b){
	return comp(a.r/b,a.i/b);
}

inline comp conj(const comp &a){
	return comp(a.r,-a.i);
}

const double PI=acos(-1.0);
const int N=2e6+7;

int rev[N];
comp Wn[N];
inline void revinit(int n){
	for(int i=0;i<n;++i)rev[i]=(rev[i>>1]>>1)|((i&1)*(n>>1));
	Wn[0]=comp(1,0);
	Wn[1]=comp(cos(2*PI/n),sin(2*PI/n));
	for(int i=2;i<n;++i)Wn[i]=Wn[i-1]*Wn[1];
}

inline void DFT(comp *A,int n){
	for(int i=0;i<n;++i)if(i<rev[i])swap(A[i],A[rev[i]]);
	for(int i=1;i<n;i<<=1){
		for(int j=0;j<n;j+=i<<1){
			for(int k=0;k<i;++k){
				comp u=A[j+k],v=A[i+j+k]*Wn[n/(i<<1)*k];
				A[j+k]=u+v;
				A[i+j+k]=u-v;
			}
		}
	}
}

inline void IDFT(comp *A,int n){
	for(int i=0;i<n;++i)if(i<rev[i])swap(A[i],A[rev[i]]);
	for(int i=1;i<n;i<<=1){
		for(int j=0;j<n;j+=i<<1){
			for(int k=0;k<i;++k){
				comp u=A[j+k],v=A[i+j+k]*conj(Wn[n/(i<<1)*k]);
				A[j+k]=u+v;
				A[i+j+k]=u-v;
			}
		}
	}
	for(int i=0;i<n;++i){
		A[i]=A[i]/n;
	}
}

int a[N];
int lg[N];
int pw[N];
int vis[N];

comp s[N];
comp t[N];

// bool isprime(int p){
//     if(p < 2) return 0;
//     for(int i = 2; i * i <= p; ++i){
//         if(p % i == 0){
//             return 0;
//         }
//     }
//     return 1;
// }

void solve(){
    int n, p; read(n), read(p);
    // int n = rand() % 2000 + 1;
    // int p = rand() % 2000 + 1;
    // while(!isprime(p)) ++p;
    bool haszero = 0;
    for(int i = 0; i < n; ++i){
        read(a[i]);
        // a[i] = rand() % p;
        if(a[i] == 0){
            haszero = 1;
            --i;
            --n;
        }
    }

    // printf("%d %d\n", n, p);
    // for(int i = 0; i < n; ++i){
    //     printf("%d ", a[i]);
    // }
    // puts("");

    if(!haszero){
        puts("1 1");
        puts("0");
        return ;
    }
    if(n == 0){
        printf("%d 1\n", p);
        for(int i = 0; i < p; ++i){
            printf("%d%c", i, " \n"[i == p - 1]);
        }
        return ;
    }
    memset(vis, 0, p << 2);
    int g = 0;
    for(g = 1; g < p; ++g){
        int prod = 1;
        bool bad = 0;
        for(int i = 0; i < p - 1; ++i){
            if(vis[prod] == g){
                bad = 1;
                break;
            }
            lg[prod] = i;
            pw[i] = prod;
            vis[prod] = g;
            prod = (ll)prod * g % p;
        }
        if(!bad){
            break;
        }
    }
    assert(g);
    for(int i = 0; i < n; ++i){
        s[lg[a[i]]] = comp(1, 0);
    }
    for(int i = 0; i < p - 1; ++i){
        s[i + p - 1] = s[i];
    }
    int len = 1;
    while(len < (p - 1) * 3){
        len <<= 1;
    }
    revinit(len);
    DFT(s, len);
    int l = 1, r = min(n, p - 1);
    pair<int, vector<int>> ans(-1, vector<int>());
    while(l <= r){
        int mid = (l + r) >> 1;
        for(int i = 0; i < len; ++i){
            t[i] = comp(0, 0);
        }
        for(int i = 1; i <= mid; ++i){
            t[p - 2 - lg[i]] = comp(1, 0);
        }
        DFT(t, len);
        for(int i = 0; i < len; ++i){
            t[i] = t[i] * s[i];
        }
        IDFT(t, len);
        bool found = 0;
        for(int i = 0; i < p - 1; ++i){
            if(round(t[i + p - 2].r) == mid){
                found = 1;
                break;
            }
        }
        if(found){
            ans.first = mid + 1;
            ans.second.clear();
            for(int i = 0; i < p - 1; ++i){
                if(round(t[i + p - 2].r) == mid){
                    ans.second.push_back(pw[i]);
                }
            }
            l = mid + 1;
        }
        else{
            r = mid - 1;
        }
    }
    for(int i = 0; i < len; ++i){
        s[i] = t[i] = comp(0, 0);
    }
    assert(ans.first != -1);
    printf("%d %d\n", ans.second.size(), ans.first);
    sort(ans.second.begin(), ans.second.end());
    for(int i = 0; i < ans.second.size(); ++i){
        printf("%d%c", ans.second[i], " \n"[i + 1 == ans.second.size()]);
    }
}

int main(){
    // freopen(".in","r",stdin);
    // freopen(".out","w",stdout);
    int T; read(T);
    while(T--){
        solve();
    }
    return 0;
}