#include<bits/stdc++.h>
using namespace std;
#define int long long
#define rep(i,j,k) for(int i=(j);i<=(k);i++)
#define per(i,j,k) for(int i=(j);i>=(k);i--)
#define pb push_back
#define mp make_pair
#define fi first
#define se second
typedef vector<int> vi;
typedef pair<int,int> pi;

const int M=520;
namespace ntt{
	const int LG=10, S=1<<LG, mod=998244353;
	int md(int x){
		return x>=mod? x-mod: x;
	}
	int qpow(int x,int y){
		int res=1;
		while(y){
			if(y%2) res=res*x%mod;
			x=x*x%mod;
			y/=2;
		}
		return res;
	}int inv(int x){return qpow(x,mod-2);}
	int iv=inv(S);
	int P[S];
	void init(){
		rep(i,0,LG-1){
			int stp=qpow(3, (mod-1)>>(i+1));
			P[1<<i]=1;
			rep(j,(1<<i)+1,(2<<i)-1){
				P[j]=P[j-1]*stp%mod;
			}
		}
	}
	void DIF(vi &a){
		per(i,LG-1,0){
			int len=1<<i;
			for(int j=0; j<S; j+=len*2){
				int idx=len;
				rep(k,j,j+len-1){
					int A=a[k], B=a[k+len];
					a[k]=md(A+B), a[k+len]=(A-B+mod)*P[idx++]%mod;
				}
			}
		}
	}
	void DIT(vi &a){
		rep(i,0,LG-1){
			int len=1<<i;
			for(int j=0; j<S; j+=len*2){
				int idx=len;
				rep(k,j,j+len-1){
					int A=a[k], B=a[k+len]*P[idx++]%mod;
					a[k]=md(A+B), a[k+len]=md(A-B+mod);
				}
			}
		}
		reverse(a.begin()+1, a.end());
		for(int &x:a){
			(x*= iv )%=mod;
		}
	}
	vi conv(vi A,vi B){
		vi dlt(17,0);
		rep(i, 1024-M, M){
			rep(j, 1024-i, M){
				(dlt[i+j-1024]+= A[i]*B[j] )%=mod;
			}
		}
		A.resize(S), B.resize(S);
		DIF(A); DIF(B);
		rep(i,0,S-1){
			(A[i]*= B[i] )%=mod;
		}
		DIT(A);
		rep(i,0,16){
			A[i]-= dlt[i];
			if(A[i]<0){
				A[i]+= mod;
			}
		}
		A.resize(M+1);
		return A;
	}
	vi convA(const vi &A,vi B,vi difA){
		B.resize(S);
		vi dlt(17,0);
		rep(i, 1024-M, M){
			rep(j, 1024-i, M){
				(dlt[i+j-1024]+= A[i]*B[j] )%=mod;
			}
		}
		B.resize(S);
		DIF(B);
		rep(i,0,S-1){
			(difA[i]*= B[i] )%=mod;
		}
		DIT(difA);
		rep(i,0,16){
			difA[i]-= dlt[i];
			if(difA[i]<0){
				difA[i]+= mod;
			}
		}
		difA.resize(M+1);
		return difA;
		
	}
}
using ntt::S;
using ntt::DIF;
using ntt::DIT;
using ntt::conv;
using ntt::convA;

void solve_998244353(int n,int q){
	const int mod=998244353;
	
	ntt::init();
	
	vector<vector<pi>> a(15);
	vector<vi> f(15, vi(M+1,0));
	rep(i,0,n-1){
		int k; cin>>k;
		a[i].resize(k);
		rep(j,0,k-1){
			cin>>a[i][j].fi>>a[i][j].se;
		}
	}
	rep(i,0,n-1){
		f[i][0]=1;
		rep(j,0,(int)a[i].size()-1){
			int L=a[i][j].fi, R=(a[i][j].se+1)*a[i][j].fi;
			rep(k,L,M){
				(f[i][k]+= f[i][k-L] )%=mod;
			}
			per(k,M,R){
				(f[i][k]+= mod-f[i][k-R] )%=mod;
			}
		}
	}
	rep(i,n,14){
		f[i][0]=1;
	}
	vector<vector<vi>> B0(256), B1(128);
	
	auto GetBlock=[&](vector<vector<vi>> &B0, const vector<vi> &f){
		int n=f.size(), U=(1<<n)-1;
		B0.resize(1<<n);
		rep(i,0,U){
			int pc=__builtin_popcount(i);
			B0[i].resize(520/max(pc,1ll)+1);
		}
		rep(s,0,U){
			B0[s][0].resize(M+1);
			if(s==0){
				B0[s][0][0]=1;
			}
			else{
				int lb=__builtin_ctz(s);
				B0[s][0]=conv(B0[s-(1<<lb)][0], f[lb]);
			}
		}
		rep(hb,-1,n-1){
			if(hb==-1){
				rep(i,1,M){
					B0[0][i].resize(M+1);
					B0[0][i][0]=1;
				}
			}
			else{
				vi c=f[hb];
				rep(i,1,M){
					c[i-1]=0;
					vi x=c;
					x.resize(S);
					DIF(x);
					
					rep(s,1<<hb,(2<<hb)-1){
						if(i<(int)B0[s].size()){
							B0[s][i]=convA(c, B0[s-(1<<hb)][i], x);
						}
					}
				}
			}
		}
		rep(s,0,U){
			vi x=B0[U-s][0];
			x.resize(S);
			DIF(x);
			
			rep(i,1,(int)B0[s].size()-1){
				B0[s][i]=convA(B0[U-s][0], B0[s][i], x);
			}
		}
	};
	GetBlock(B0, (vector<vi>){f.begin(), f.begin()+8});
	GetBlock(B1, (vector<vi>){f.begin()+8, f.end()});
	
	rep(i,1,q){
		string s; cin>>s;
		int m,k; cin>>m>>k;
		
		int c=0;
		rep(j,0,n-1){
			c+=(s[j]=='1'? (1<<j): 0);
		}
		int pc=__builtin_popcount(c);
		if(pc*k>m){
			cout<<0<<'\n';
			continue;
		}
		int A=c&255, B=c>>8;
		
		const vi &res0=(A==0? B0[255][0]: B0[A][k]), res1=(B==0? B1[127][0]: B1[B][k]);
		int sum=0, ans=0;
		rep(j,0,m){
			(sum+= res0[j] )%=mod;
		}
		rep(j,0,m){
			(ans+= sum*res1[j] )%=mod;
			(sum+= mod-res0[m-j] )%=mod;
		}
		cout<< ans <<'\n';
	}
}
signed main(){
	ios::sync_with_stdio(0);cin.tie(0);cout.tie(0);
	
	int n,q,mod; cin>>n>>q>>mod;
	if(mod==998244353){
		solve_998244353(n,q);
	}
}