#include<cstdio>
#include<iostream>
#include<vector>
#include<cmath>
#define RI register int
#define CI const int&
using namespace std;
const int N=200005;
int t,n,p,x,a[N],ans[N];
inline int quick_pow(int x,int mod,int p,int mul=1)
{
	for (;p;p>>=1,x=1LL*x*x%mod) if (p&1) mul=1LL*mul*x%mod; return mul;
}
int main()
{
	//freopen("F.in","r",stdin);
	for (scanf("%d",&t);t;--t)
	{
		RI i,c; for (scanf("%d%d",&n,&p),i=0;i<p;++i) a[i]=0;
		for (i=1;i<=n;++i) scanf("%d",&x),a[x]=1;
		if (!a[0]) { puts("1 1\n0"); continue; } else ans[0]=1;
		if (p-n<=(int)sqrt(p))
		{
			vector <int> vec;
			for (i=0;i<p;++i) if (!a[i]) vec.push_back(i);
			for (c=0;c<p;++c)
			{
				int mex=p;
				for (auto x:vec) mex=min(mex,(int)(1LL*c*x%p));
				ans[c]=mex;
			}
		} else
		{
			for (c=0;c<p;++c)
			{
				int mex=1,inv=quick_pow(c,p,p-2);
				while (a[1LL*mex*inv%p]) ++mex;
				ans[c]=mex;
			}
		}
		int mx=0; vector <int> num;
		for (i=0;i<p;++i) mx=max(mx,ans[i]);
		for (i=0;i<p;++i) if (ans[i]==mx) num.push_back(i);
		printf("%d %d\n",num.size(),mx);
		for (auto x:num) printf("%d ",x); putchar('\n');
	}
	return 0;
}