#include<bits/stdc++.h>
#define fo(i,l,r) for(int i=l;i<=r;++i)
#define fd(i,r,l) for(int i=r;i>=l;--i)
#define ll long long
#define I inline int
#define V inline void
#define B inline bool
#define L inline ll
#define pi pair<int,int>
#define mk make_pair
#define fi first
#define se second
#define pb push_back
#define vi vector<int>
#define vii vector<pi>
using namespace std;
char St;
I read() {
	int x=0,y=1;char c=getchar();
	while(c<48||c>57) {if(c==45)y=-y;c=getchar();}
	while(c>=48&&c<=57) x=(x<<1)+(x<<3)+(c^48),c=getchar();
	return x*y;
}
int n,q;
namespace mod1 {
	const int mod=998244353,M=2041,N=5,M2=520;
	int pw[M+5][M+5],dp[20][M2+5],f1[1<<N][M+5],f2[1<<N][M+5],f3[1<<N][M+5],a[M+5],dpp[20][M+5];
	int g1[1<<N][M+5],g2[1<<N][M+5],g3[1<<N][M+5],fx[M+5][M+5];
	int ans[N],lg[M+9],pop[M+9],inv[M+5];
	struct ques {
		int st,m,id;
	};
	vector<ques> Q[M2+5];
	L ksm(ll x,int y) {
		ll t(1);for(;y;y>>=1,x=x*x%mod)if(y&1)t=t*x%mod;return t;
	}
	V add(int &x,int y) {x+=y;if(x>=mod) x-=mod;}
	V sub(int &x,int y) {x-=y;if(x<0) x+=mod;}
	V solve() {
		fo(i,1,M) {
			pw[i][0]=1;
			fo(j,1,M) pw[i][j]=1ll*pw[i][j-1]*i%mod;
		}
		fo(i,1,M) inv[i]=ksm(i,mod-2);
		fo(i,1,n) {
			dp[i][0]=1;
			int m=read();
			fo(j,1,m) {
				int b=read(),c=read();
				fd(j,M2,0) {
					if(j+b*(c+1)<=M2) add(dp[i][j+b*(c+1)],dp[i][j]);
					dp[i][j]=(mod-dp[i][j])%mod;
				}
				fo(j,0,M2) {
					dp[i][j]=(mod-dp[i][j])%mod;
					if(j+b<=M2) sub(dp[i][j+b],dp[i][j]);
				}
			}
//			fo(j,0,10) printf("%d ",dp[i][j]);puts("");
		}
		fx[0][0]=1;
		fo(i,1,M) {
			fd(j,i-1,0) add(fx[0][j+1],fx[0][j]),fx[0][j]=(mod-1ll*i*fx[0][j]%mod)%mod;
//			if(i<=10) {
//				fo(j,0,i) printf("%d ",fx[0][j]);puts("");
//			}
		}
		fo(i,1,M) {
			fo(j,0,M) fx[i][j]=fx[0][j];
			fo(j,0,M) {
				fx[i][j]=(mod-1ll*inv[i]*fx[i][j]%mod)%mod;
				if(j+1<=M) sub(fx[i][j+1],fx[i][j]);
			}
			ll t(1);
			fo(j,1,i-1) t=mod-t*inv[i-j]%mod;
			fo(j,i+1,M) t=t*inv[j-i]%mod;
			fo(j,0,M) fx[i][j]=fx[i][j]*t%mod; 
			fo(j,1,M) add(fx[i][j],fx[i][j-1]);
		}
		//fx
		int l1=n/3,l2=n/3,l3=n/3;
		if(n%3>=1) l1++;
		if(n%3>=2) l2++;
		fo(i,1,q) {
			string t;cin>>t;
			int st(0),s(0);
			fo(j,1,n) if(t[j-1]=='1') st|=1<<j-1,s++;
			int m=read(),k=read();
			if(s*k<=m) Q[k].pb({st,m,i});
		}
		f1[0][0]=f2[0][0]=f3[0][0]=1;
		fo(i,1,10) lg[1<<i]=i;
		fo(i,1,M) pop[i]=pop[i>>1]+(i&1);
		fo(i,1,(1<<l1)-1) {
			int lst=i^(i&-i),ps=lg[i&-i]+1;
			fo(j,0,M2) fo(k,0,M2-j) add(f1[i][j+k],1ll*f1[lst][j]*dp[ps][k]%mod);
		}
		fo(i,1,(1<<l2)-1) {
			int lst=i^(i&-i),ps=lg[i&-i]+l1+1;
			fo(j,0,M2) fo(k,0,M2-j) add(f2[i][j+k],1ll*f2[lst][j]*dp[ps][k]%mod);
		}
		fo(i,1,(1<<l3)-1) {
			int lst=i^(i&-i),ps=lg[i&-i]+l1+l2+1;
			fo(j,0,M2) fo(k,0,M2-j) add(f3[i][j+k],1ll*f3[lst][j]*dp[ps][k]%mod);
		}
		fo(i,0,(1<<l1)-1) {
			fo(j,0,M2) a[j]=f1[i][j],f1[i][j]=0;
			fo(j,1,M) {
				fo(k,0,M2) add(f1[i][j],1ll*a[k]*pw[j][k]%mod);
			}
		}
		fo(i,0,(1<<l2)-1) {
			fo(j,0,M2) a[j]=f2[i][j],f2[i][j]=0;
			fo(j,1,M) {
				fo(k,0,M2) add(f2[i][j],1ll*a[k]*pw[j][k]%mod);
			}
		}
		fo(i,0,(1<<l3)-1) {
			fo(j,0,M2) a[j]=f3[i][j],f3[i][j]=0;
			fo(j,1,M) {
				fo(k,0,M2) add(f3[i][j],1ll*a[k]*pw[j][k]%mod);
			}
		}
		fo(k,1,M2) {
			fo(i,1,n) fo(j,1,M) add(dpp[i][j],1ll*pw[j][k-1]*dp[i][k-1]%mod);
			if(!Q[k].size()) continue;
			fo(j,1,M) g1[0][j]=g2[0][j]=g3[0][j]=1;
			fo(S,1,(1<<l1)-1) if(pop[S]*k<=M2) {
				int lst=S^(S&-S),ps=lg[S&-S]+1;
				fo(j,1,M) g1[S][j]=(mod-1ll*g1[lst][j]*dpp[ps][j]%mod)%mod;
			}
			fo(S,1,(1<<l2)-1) if(pop[S]*k<=M2) {
				int lst=S^(S&-S),ps=lg[S&-S]+l1+1;
				fo(j,1,M) g2[S][j]=(mod-1ll*g2[lst][j]*dpp[ps][j]%mod)%mod;
			}
			fo(S,1,(1<<l3)-1) if(pop[S]*k<=M2) {
				int lst=S^(S&-S),ps=lg[S&-S]+l1+l2+1;
				fo(j,1,M) g3[S][j]=(mod-1ll*g3[lst][j]*dpp[ps][j]%mod)%mod;
			}
			//g
			fo(S,0,(1<<l1)-1) fo(j,1,M) g1[S][j]=1ll*g1[S][j]*f1[S^((1<<l1)-1)][j]%mod;
			fo(S,0,(1<<l2)-1) fo(j,1,M) g2[S][j]=1ll*g2[S][j]*f2[S^((1<<l2)-1)][j]%mod;
			fo(S,0,(1<<l3)-1) fo(j,1,M) g3[S][j]=1ll*g3[S][j]*f3[S^((1<<l3)-1)][j]%mod;
			//g*f
			fo(i,0,l1-1) for(int j=0;j<(1<<l1);j+=1<<i+1) 
			fo(k,0,(1<<i)-1) {
				fo(S,1,M) add(g1[(1<<i)+j+k][S],g1[j+k][S]);
			}
			fo(i,0,l2-1) for(int j=0;j<(1<<l2);j+=1<<i+1) 
			fo(k,0,(1<<i)-1) {
				fo(S,1,M) add(g2[(1<<i)+j+k][S],g2[j+k][S]);
			}
			fo(i,0,l3-1) for(int j=0;j<(1<<l3);j+=1<<i+1) 
			fo(k,0,(1<<i)-1) {
				fo(S,1,M) add(g3[(1<<i)+j+k][S],g3[j+k][S]);
			}
			//suffix sum
			for(auto t:Q[k]) {
//				printf("%d %d: %d %d %d\n",t.st,t.id,t.st&(1<<l1)-1,(t.st>>l1)&(1<<l2)-1,(t.st>>l1+l2)&(1<<l3)-1);
				fo(i,1,M) {
					add(ans[t.id],1ll*fx[i][t.m]*g1[t.st&(1<<l1)-1][i]%mod*g2[(t.st>>l1)&(1<<l2)-1][i]%mod*g3[(t.st>>l1+l2)&(1<<l3)-1][i]%mod);
				}
			}
			//getans
			fo(S,0,(1<<5)-1) fo(i,1,M) g1[S][i]=g2[S][i]=g3[S][i]=0;
		}
		fo(i,1,q) printf("%d\n",ans[i]);
	}
}
char Ed;
int main() {
	cerr<<"memory:"<<(&St-&Ed)/1024.0<<endl;
	n=read();q=read();int m=read();
	if(m==998244353) mod1::solve();
	cerr<<"time:"<<clock()<<endl;
	return 0;
}