#include<bits/stdc++.h>
using namespace std;
int T,P,n,a[4],f[2][105][105][105],C[105][105];
struct Fastmod{
typedef __uint128_t uLL;
typedef unsigned long long ull;
ull P,m;
void init(ull P){
	this->P=P,m=(uLL(1)<<64)/P;
}
ull mod(ull a){
	ull b=uLL(a)*m>>64;
	ull r=a-b*P;
	return r>=P?r-P:r;
}
}Z;
int ksm(int x,long long y){
	int res=1;
	for(;y;y>>=1,x=Z.mod(1ll*x*x))if(y&1)res=Z.mod(1ll*res*x);
	return res;
}
inline void Add(int &x,int y){
	if((x+=y)>=P)x-=P;
}
void solve(){
	scanf("%d",&n);
	for(int i=0;i<4;++i)scanf("%d",&a[i]);
	for(int i=0;i<=n;++i)for(int j=0;j<=n;++j)for(int k=0;k<=n;++k)f[0][i][j][k]=f[1][i][j][k]=0;
	f[0][0][0][0]=1;
	for(int o=0,p=0,q=1,t=0;o<4;++o)for(int c=0;c<a[o];++c,++t,p^=1,q^=1){
		for(int i=0;i<=t;++i)for(int j=0;j+i<=t;++j)for(int k=0;k+j+i<=t;++k)if(f[p][i][j][k]){
			int l=t-i-j-k,v=f[p][i][j][k];//printf("?%d %d %d %d %d\n",t,i,j,k,l);
			f[p][i][j][k]=0;
			for(int i1=0;i1<=i;++i1)for(int j1=0;j1<=j;++j1)for(int k1=0;k1<=k;++k1)for(int l1=0;l1<=l;++l1){
				int w=Z.mod(Z.mod(Z.mod(1ull*C[i][i1]*C[j][j1])*C[k][k1])*C[l][l1]);
				int r=(o-i1-j1-k1-l1)&3;
				int i0=i-i1+j1,j0=j-j1+k1,k0=k-k1+l1,l0=l-l1+i1;
				if(r==0)++i0;
				if(r==1)++j0;
				if(r==2)++k0;
				if(r==3)++l0;
				Add(f[q][i0][j0][k0],Z.mod(1ll*v*w));
			}
		}
	}
	printf("%d\n",Z.mod(1ll*f[n&1][n][0][0]*ksm(P+1>>1,1ll*n*(n-1)/2)));
}
int main(){
	scanf("%d%d",&T,&P);
	Z.init(P);
	for(int i=0;i<=100;++i)C[i][0]=1;
	for(int i=1;i<=100;++i)for(int j=1;j<=i;++j)C[i][j]=Z.mod(C[i-1][j]+C[i-1][j-1]);
	while(T--)solve();
	return 0;
}