#include<bits/stdc++.h>
using namespace std;
inline int qread()
{
	int a=0,f=1;char ch=getchar();
	while(!isdigit(ch)){if(ch=='-')f=-1;ch=getchar();}
	while(isdigit(ch)){(a*=10)+=(ch^48);ch=getchar();}
	return a*f;
}
int T,mod,n,a[4],cnt,b[4],op;
inline int fmod(int x)
{
	if(x>=mod)x-=mod;
	return x;
}
struct node
{
	int a,b;
}ans,an;
inline node operator +(node x,node y){return (node){fmod(x.a+y.a),fmod(x.b+y.b)};}
inline node operator -(node x,node y){return (node){fmod(x.a-y.a+mod),fmod(x.b-y.b+mod)};}
inline node operator *(node x,node y){return (node){(1ll*x.a*y.a-1ll*x.b*y.b%mod+mod)%mod,(1ll*x.a*y.b+1ll*x.b*y.a)%mod};}
inline int qpow(long long x,long long y)
{
	long long cx=1;
	while(y)
	{
		(y&1)&&((cx*=x)%=mod);
		(x*=x)%=mod;
		y>>=1;
	}
	return cx;
}
inline node qpow(node x,long long y)
{
	node cx=(node){1,0};
	while(y)
	{
		if(y&1)cx=cx*x;
		x=x*x;
		y>>=1;
	}
	return cx;
}
inline node get_w(int x)
{
	if(x==0)return (node){1,0};
	if(x==1)return (node){0,1};
	if(x==2)return (node){mod-1,0};
	if(x==3)return (node){0,mod-1};
	return (node){0,0};
}
inline void dfs(int h,int sz,int pw)
{
	if(h==4)
	{
		pw=4-pw;
		an=get_w(pw)*(node){sz,0};
		for(int i=0;i<=3;++i)an=an*qpow(get_w(i*2),1ll*b[i]*(b[i]-1)/2);
		for(int i=0;i<=3;++i)for(int j=i+1;j<=3;++j)an=an*qpow(get_w(i+j),1ll*b[i]*b[j]);
		return ans=ans+an,void();
	}
	b[op]+=a[h];dfs(h+1,sz,(pw+op*a[h]*h)&3);b[op]-=a[h];
	if(a[h]&&!b[1])b[op]+=a[h]-1,++b[1];dfs(h+1,1ll*cnt*a[h]%mod,(pw+op*(a[h]-1)*h+1)&3);--b[1],b[op]-=a[h]-1;
	if(a[h]&&!b[3])b[op]+=a[h]-1,++b[3];dfs(h+1,1ll*cnt*a[h]%mod,(pw+op*(a[h]-1)*h+3)&3);--b[3],b[op]-=a[h]-1;
	if(a[h]>=2&&!b[1]&&!b[3])b[op]+=a[h]-2,++b[1],++b[3];dfs(h+1,1ll*cnt*a[h]%mod*(a[h]-1)%mod,(pw+op*(a[h]-2)*h)&3);--b[1],--b[3],b[op]-=a[h]-2;
	return ;
}
int main()
{
	T=qread(),mod=qread();
	while(T--)
	{
		n=qread();
		for(int i=0;i<=3;++i)a[i]=qread();
		if(!n)puts("0");
		else if(n==1)
		{
			if(a[0])puts("1");
			else puts("0");
		}
		else if(n==2)
		{
			if(a[0]==2||a[1]==2)printf("%d\n",qpow(2,mod-2));
			else puts("0");
		}
		else
		{
			cnt=qpow(qpow(2,(1ll*n*(n-1)/2))*qpow(4,n)%mod,mod-2);
			op=0;b[0]=b[1]=b[2]=b[3]=0;dfs(0,1,0);
			op=2;b[0]=b[1]=b[2]=b[3]=0;dfs(0,1,0);
			printf("%lld\n",1ll*ans.a*cnt%mod);
		}
	}
	return 0;
}