[SDOI2013]方程

#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const int N=1e5+5;
const int M=5e6+5;
ll r[M],md[N],a[N],jc[M];
ll ksm(ll t,ll b,ll mod) {
	ll mul=1;
	for(ll i=b;i;i>>=1) {
		if(i&1) mul=mul*t%mod; t=t*t%mod;
	}
	return mul;
}
ll ex_gcd(ll a,ll b,ll &x,ll &y) {
	if(b==0) {x=1; y=0; return a;}
	ll d=ex_gcd(b,a%b,x,y);
	ll xx=x; x=y; y=xx-a/b*y;
	return d;
}
ll inv(ll u,ll p) {
	ll v,k,d=ex_gcd(u,p,v,k);
	v%=(p/d);
	if(v<0) v+=(p/d);
	return v;
}
ll fac(ll n,ll pk,ll p) {
	if(n==0||n==1) return 1;
	return fac(n/p,pk,p)*ksm(jc[pk],n/pk,pk)%pk*jc[n%pk]%pk;
}
ll Cnt(ll n,ll p) {
	ll sum=0;
	for(ll i=n;i;i/=p) sum+=i/p;
	return sum;
}
ll C_modpk(ll n,ll m,ll p,ll pk)	{
	jc[0]=1;
	for(ll i=1;i<=pk;i++) 
		if(i%p) jc[i]=jc[i-1]*i%pk;
		else jc[i]=jc[i-1];
	return fac(n,pk,p)*inv(fac(m,pk,p),pk)%pk*inv(fac(n-m,pk,p),pk)%pk*ksm(p,(Cnt(n,p)-Cnt(m,p)-Cnt(n-m,p)),pk)%pk;
}
ll CRT(int tot) {
	ll mul=1,sum=0,x,y;
	for(int i=1;i<=tot;i++) mul*=md[i];
	for(int i=1;i<=tot;i++) {
		ll d=ex_gcd(mul/md[i],md[i],x,y);
		sum+=(mul/md[i])*x%mul*r[i]%mul%mul,sum=(sum%mul+mul)%mul;
	}
	return sum;
}
ll ex_Lucas(ll n,ll m,ll P) {
    if(n<m) return 0;
	int tot=0;
	for(ll p=2;p*p<=P;p++) {
		ll pk=1;
		if(!(P%p)) {
			while(!(P%p)) {P/=p; pk*=p; }
			md[++tot]=pk; r[tot]=C_modpk(n,m,p,pk);
		}
	} 
	if(P>1) {
		md[++tot]=P; r[tot]=C_modpk(n,m,P,P);
	}
	ll ans=CRT(tot);
	return ans;
}
int main() {
	int T;
	ll sum=0,p;
	scanf("%d%lld",&T,&p);
	while(T--) {
		ll n,n1,n2,m,ans;
		scanf("%lld%lld%lld%lld",&n,&n1,&n2,&m);
		for(int i=0;i<n1+n2;i++) {
			scanf("%lld",&a[i]);
			if(i>=n1) m-=a[i]-1;
		}
		ans=ex_Lucas(m-1,n-1,p)%p;
		for(int s=1;s<(1<<n1);s++) {
			ll cnt=0,tmp=m;
			for(int i=0;i<n1;i++) {
				if(s&(1<<i)) {
					cnt++,tmp-=a[i];
				}
			} 
			if(cnt&1) ans-=ex_Lucas(tmp-1,n-1,p);
			else ans+=ex_Lucas(tmp-1,n-1,p);
			ans=(ans%p+p)%p;
		}
		printf("%lld\n",(ans%p+p)%p);
	}
	return 0;
}