#include<cstdio>
#include<iostream>
#include<vector>
#include<algorithm>
#define RI register int
#define CI const int&
using namespace std;
const int N=200005;
typedef unsigned long long u64;
int t,n,p,a[N],inv[N],vis[N],cnt,pri[N],pw[N],rev[N],c[N<<1],lst[N<<1];
struct Bitset
{
	vector <u64> a;
	inline Bitset(CI N=0)
	{
		a=vector <u64> ((N>>6)+1,0ull);
	}
	inline void set(CI x)
	{
		a[x>>6]|=(1ull<<(x&63));
	}
	inline int get(CI x)
	{
		return (a[x>>6]>>(x&63))&1;
	}
	inline bool empty()
	{
		for (RI i=0;i<a.size();++i) if (a[i]) return 0; return 1;
	}
	inline u64& operator [] (CI x)
	{
		return a[x];
	}
	inline const u64& operator [] (CI x) const
	{
		return a[x];
	}
	inline int size(void)
	{
		return a.size();
	}
	friend inline Bitset operator & (const Bitset& A,const Bitset& B)
	{
		Bitset C(p); for (RI i=0;i<C.size();++i) C[i]=A[i]&B[i]; return C;
	}
};
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;
}
inline void init(CI n)
{
	for (RI i=2,j;i<=n;++i)
	{
		if (!vis[i]) pri[++cnt]=i;
		for (j=1;j<=cnt&&i*pri[j]<=n;++j)
		if (vis[i*pri[j]]=1,i%pri[j]==0) break;
	}
}
inline vector <int> resolve(int x)
{
	vector <int> vec;
	for (RI i=1;i<=cnt&&1LL*pri[i]*pri[i]<=x;++i)
	if (x%pri[i]==0)
	{
		vec.push_back(pri[i]);
		while (x%pri[i]==0) x/=pri[i];
	}
	if (x>1) vec.push_back(x);
	return vec;
}
inline int get_root(CI p)
{
	vector <int> frac=resolve(p-1);
	for (RI i=2;i<=p;++i)
	{
		bool flag=1;
		for (auto x:frac)
		if (quick_pow(i,p,(p-1)/x)==1)
		{
			flag=0; break;
		}
		if (flag) return i;
	}
	return -1;
}
int main()
{
	//freopen("F.in","r",stdin);
	for (scanf("%d",&t),init(200000);t;--t)
	{
		RI i,j; for (scanf("%d%d",&n,&p),i=1;i<=n;++i)
		if (scanf("%d",&a[i]),a[i]) inv[i]=quick_pow(a[i],p,p-2);
		bool ext_zero=0; for (i=1;i<=n;++i) if (a[i]==0) ext_zero=1;
		if (!ext_zero) { puts("1 1\n0"); continue; }
		if (n==p)
		{
			printf("%d %d\n",p-1,p);
			for (i=1;i<p;++i) printf("%d ",i); putchar('\n');
			continue;
		}
		if (p<=1000)
		{
			Bitset pre(p); for (i=0;i<pre.size();++i) pre[i]=-1ull;
			bool flag=0; for (i=1;i<p;++i)
			{
				Bitset cur(p);
				for (j=1;j<=n;++j) if (a[j]) cur.set(1LL*i*inv[j]%p);
				cur=cur&pre;
				if (cur.empty())
				{
					vector <int> ans;
					for (j=0;j<p;++j) if (pre.get(j)) ans.push_back(j);
					printf("%d %d\n",ans.size(),i);
					for (auto x:ans) printf("%d ",x); putchar('\n');
					flag=1; break;
				}
				pre=cur;
			}
			if (!flag)
			{
				vector <int> ans;
				for (j=0;j<p;++j) if (pre.get(j)) ans.push_back(j);
				printf("%d %d\n",ans.size(),p);
				for (auto x:ans) printf("%d ",x); putchar('\n');
			}
		} else
		{
			int g=get_root(p);
			for (pw[0]=i=1;i<p-1;++i) pw[i]=1LL*pw[i-1]*g%p;
			for (i=0;i<p-1;++i) rev[pw[i]]=i;
			for (i=0;i<2*(p-1);++i) c[i]=0;
			for (i=1;i<=n;++i) if (a[i])
			c[rev[a[i]]]=c[rev[a[i]]+p-1]=1;
			for (lst[2*(p-1)-1]=c[2*(p-1)-1],i=2*(p-1)-2;i>=0;--i)
			if (!c[i]) lst[i]=0; else lst[i]=lst[i+1]+1;
			int mx=0; for (i=0;i<2*(p-1);++i) mx=max(mx,lst[i]);
			vector <int> ans;
			for (i=0;i<p-1;++i) if (lst[i]==mx) ans.push_back(pw[p-1-i]);
			sort(ans.begin(),ans.end());
			printf("%d %d\n",ans.size(),mx+1);
			for (auto x:ans) printf("%d ",x); putchar('\n');
		}
	}
	return 0;
}