#include<bits/stdc++.h>
#define Gc() getchar() 
#define Me(x,y) memset(x,y,sizeof(x))
#define Mc(x,y) memcpy(x,y,sizeof(x))
#define d(x,y) ((m)*(x-1)+(y))
#define R(n) (rnd()%(n)+1)
#define Pc(x) putchar(x)
#define LB lower_bound
#define UB upper_bound
#define fi first
#define se second
#define eb emplace_back
using namespace std;using ll=long long;using db=double;using lb=long db;using ui=unsigned;using ull=unsigned long long;using pii=pair<int,int>;using LL=__int128;
const int N=1e6+5,M=N*4+5,K=(1<<25)+5,mod=1e9+7,Mod=mod-1;const db eps=1e-9;const int INF=1e9+7;mt19937 rnd(time(0));
int p,n,a[4];
struct img{
	ll a,b;
	img operator +(const img &B)const{return (img){(a+B.a)%p,(b+B.b)%p};}
	img operator -(const img &B)const{return (img){(a-B.a)%p,(b-B.b)%p};}
	img operator *(const img &B)const{return (img){(a*B.a-b*B.b)%p,(a*B.b+b*B.a)%p};}
	img operator *(const ll B)const{return (img){a*B%p,b*B%p};}
}iw[30];
img mpow(img x,ll y){img ans=(img){1,0};while(y) y&1&&(ans=ans*x,0),y>>=1,x=x*x;return ans;}
ll mpow(ll x,ll y=p-2){ll ans=1;while(y) y&1&&(ans=ans*x%p),y>>=1,x=x*x%p;return ans;}
int c[4];
ll ans;
void calc(int x,img y){
	for(int i=0;i<4;i++){
		y=y*iw[(4-i)*x*a[i]%4];
		c[x]+=a[i];
	}
	// if(!(c[1]&&c[3]&&c[x])){
		if(c[x]&&c[1]) y=y*mpow(iw[x+1]+iw[0],c[x]);
		if(c[x]&&c[3]) y=y*mpow(iw[x+3]+iw[0],c[x]);
		if(y.a){
			y.a*=mpow(2,1ll*c[x]*(c[x]-1)/2);
			if(c[1]&&c[3]) y.a*=2;
			ans+=y.a%mod;
		}
	// }
	for(int i=0;i<4;i++) c[x]-=a[i];
}
void dfs(int x,img w){
	if(x==5) return c[1]+c[3]<n&&(calc(0,w),0),calc(2,w);
	dfs(x+2,w);
	for(int i=0;i<4;i++) if(a[i]) a[i]--,c[x]++,dfs(x+2,w*(img){a[i]+1,0}*iw[(4-i)*x]),c[x]--,a[i]++;
}
void Solve(){
	int i,j;scanf("%d",&n);
	for(i=0;i<4;i++) scanf("%d",&a[i]);
	ans=0;dfs(1,(img){1,0});
	printf("%lld\n",(ans%p+p)*mpow(mpow(4,n)*mpow(2,1ll*n*(n-1)/2)%p)%p);
}
void init(){
	iw[0]=(img){1,0};
	for(int i=1;i<20;i++) iw[i]=iw[i-1]*(img){0,1};
}
int main(){
	int t=1;
	scanf("%d%d",&t,&p);t=min(t,50000);
	init();
	while(t--) Solve();
	cerr<<clock()*1.0/CLOCKS_PER_SEC<<'\n';
}