#include<bits/stdc++.h>
// #define int ll
#define ll long long
#define fr(i,j,k) for(register int i=j;i<=k;++i)
#define rf(i,j,k) for(register int i=j;i>=k;--i)
#define foredge(i,j) for(register int i=head[j];i;i=e[i].nxt)
#define pb push_back
#define Times printf("Time:%.3lf\n",clock()/CLOCKS_PER_SEC)
#define pii pair<int,int>
#define mk make_pair
using namespace std;
inline int read(){
	int x=0;
	bool f=0;
	char c=getchar();
	while(!isdigit(c)) f|=(c=='-'),c=getchar();
	while(isdigit(c)) x=(x<<3)+(x<<1)+(c^48),c=getchar();
	return f?-x:x;
}
inline void write(int x){
    if(x<0){putchar('-');x=-x;}
    if(x>9)write(x/10);
    putchar(x%10+'0');
}
inline void writeln(int x){write(x); puts("");}
inline void writepl(int x){write(x); putchar(' ');}
mt19937 rnd(chrono::steady_clock::now().time_since_epoch().count());
inline int randfind(int l,int r){return rnd()%(r-l+1)+l;}
//inline void init(){
//	int t=read();
//	while(t--) work();
//}
int mod;
struct node{int x,y;};
inline void add(int &x,int y){x+=y;if(x>=mod) x-=mod;}
node operator + (node A,node B){
    node C;C.x=(A.x+B.x)%mod;C.y=(A.y+B.y)%mod;
    return C;
}
node operator - (node A,node B){
    node C;C.x=(A.x-B.x+mod)%mod;C.y=(A.y-B.y+mod)%mod;
    return C;
}
node operator * (node A,node B){
    node C;C.x=1ll*A.x*B.x%mod;add(C.x,mod-1ll*A.y*B.y%mod);
    C.y=1ll*A.x*B.y%mod;add(C.y,1ll*A.y*B.x%mod);return C;
}
inline int Pow(int x,ll y=mod-2){
    int sum=1;
    while(y){
        if(y&1) sum=1ll*sum*x%mod;
        y=y/2;x=1ll*x*x%mod;
    }
    return sum;
}
inline node ksm(node x,ll y){
    node sum=(node){1,0};
    while(y){
        if(y&1) sum=sum*x;
        y=y/2;x=x*x;
    }
    return sum;
}
int a[5];
node w[100];
int s[5],n;
ll ans;
inline void check(int tp,node now){
    // cout<<"**"<<endl;
    // cout<<tp<<' '<<now.x<<' '<<now.y<<endl;
    fr(i,0,3){
        now=now*w[(4-tp)*a[i]*i%4];
        s[tp]+=a[i];
    }
    fr(i,0,3) if(s[i]) {
        now=now*ksm(w[2*i]+w[0],1ll*s[i]*(s[i]-1)/2);
        fr(j,i+1,3) if(s[j]) now=now*ksm(w[(i+j)]+w[0],1ll*s[i]*s[j]);
    }
    ans+=now.x;
    fr(i,0,3) s[tp]-=a[i];
}
inline void dfs(int x,node now){
    if(x==5){
        if(s[1]+s[3]>n) return;
        check(2,now);
        if(s[1]+s[3]==n) return;
        check(0,now);
        return;
    }
    dfs(x+2,now);
    fr(i,0,3){
        if(!a[i]) continue;
        if(a[i]){
            --a[i];++s[x];
            dfs(x+2,now*(node){a[i]+1,0}*w[(4-x)*i]);
            ++a[i];--s[x];
        }
    }
}
inline void work(){
    n=read();fr(i,0,3) a[i]=read();
    ans=0;dfs(1,(node){1,0});
    // cout<<ans<<endl;
    ans=ans%mod*Pow(1ll*Pow(4,n)*Pow(2,1ll*n*(n-1)/2)%mod)%mod;
    writeln(ans);
}
inline void init(){
    int t=read();mod=read();
    w[0]=(node){1,0};
    fr(i,1,50) w[i]=w[i-1]*(node){0,1};
    // fr(i,0,3) cout<<i<<' '<<w[i].x<<' '<<w[i].y<<endl;
    while(t--) work();
}
signed main(){
	// freopen("input.in","r",stdin);
	// freopen("output.out","w",stdout);
    init();
    // printf("\nTIME:%.3lf",(double)clock()/CLOCKS_PER_SEC);
	return 0;
}