#include <cstdio>
#include <iostream>
#define macro_expand(x) #x
#define print_macro(x) printf("%s\n",macro_expand(x))
#define FOR(i,l,r) for(int i=(l),i##ADJK=(r);i<=i##ADJK;++i)
#define ROF(i,r,l) for(int i=(r),i##ADJK=(l);i>=i##ADJK;--i)
using namespace std;
typedef long long LL;
namespace work1{
	const int MN=20,Mod=998244353,len=2048;
	int N,q,UIJF,poly[MN][525],p2[MN][525],A[len+5],B[len+5],rev[len+5],g[20],ig[20];
	int ad(int x,int y){
		static int moji;
		moji=x+y;
		return (moji>=Mod)?(moji-Mod):moji;
	}
	int dc(int x,int y){
		static int moji;
		moji=x-y;
		return (moji<0)?(moji+Mod):moji;
	}
	int ml(int x,int y){return (LL)x*y%Mod;}
	int add(int &x,int y){return ((x+=y)>=Mod)?(x-=Mod):x;}
	int dec(int &x,int y){return ((x-=y)<0)?(x+=Mod):x;}
	int ksm(int x,int y){
		int ret=1;
		for(;y;y>>=1,x=ml(x,x))
			if(y&1)
				ret=ml(ret,x);
		return ret;
	}
	void init(){
		FOR(i,1,len-1)rev[i]=(rev[i>>1]>>1)|((i&1)?(len>>1):0);
		FOR(i,0,11)g[i]=ksm(3,(Mod-1)>>i);
		FOR(i,0,11)ig[i]=ksm(g[i],Mod-2);
	}
	void ntt(int *a,int type){
		FOR(i,0,len-1)if(i<rev[i])swap(a[i],a[rev[i]]);
		int cnt=1;
		for(int l=2;l<=len;l<<=1){
			int w=(type>0)?g[cnt]:ig[cnt];
			++cnt;
			for(int b=0;b<len;b+=l){
				int wn=1;
				FOR(i,b,b+(l>>1)-1){
					int x=a[i],y=ml(a[i+(l>>1)],wn);
					a[i]=ad(x,y);
					a[i+(l>>1)]=dc(x,y);
					wn=ml(wn,w);
				}
			}
		}
		if(type==-1){
			int inv=ksm(len,Mod-2);
			FOR(i,0,len-1)a[i]=ml(a[i],inv);
		}
	}
	void mul(){
		ntt(A,1),ntt(B,1);
		FOR(i,0,len-1)A[i]=ml(A[i],B[i]);
		ntt(A,-1);
		// FOR(i,0,10)cerr<<A[i]<<" ";
		// cerr<<endl;
		// FOR(i,0,10)cerr<<B[i]<<" ";
		// cerr<<endl;
	}
	int ling[1<<15][525];
	void main(){
		init();
		scanf("%d%d%d",&N,&q,&UIJF);
		FOR(i,1,N){
			int a=0;scanf("%d",&a);
			poly[i][0]=1;
			FOR(j,1,a){
				int b=0,c=0;scanf("%d%d",&b,&c);
				c=min(c,520/b);
				if(c<=15){
					ROF(x,520,0)FOR(d,1,c)add(poly[i][x],poly[i][x-d*b]);
				}else{
					FOR(x,0,520)A[x]=poly[i][x];
					FOR(x,521,len-1)A[x]=0;
					FOR(x,0,len-1)B[x]=0;
					FOR(x,0,c)B[x*b]=1;
					mul();
					FOR(x,0,520)poly[i][x]=A[x];
				}
			}
			// FOR(j,0,20)cerr<<poly[i][j]<<" ";
			// cerr<<endl;
		}
		static int wei[1<<15];
		FOR(i,0,N-1)wei[1<<i]=i;
		ling[0][0]=1;
		FOR(i,1,(1<<N)-1){
			int t=i&(-i);
			FOR(j,0,520)A[j]=ling[i^t][j];
			FOR(j,521,len-1)A[j]=0;
			FOR(j,0,520)B[j]=poly[wei[t]+1][j];
			FOR(j,521,len-1)B[j]=0;
			mul();
			FOR(j,0,520)ling[i][j]=A[j];
		}
		while(q--){
			static char str[20];
			scanf("%s",str);
			int m=0,k=0;scanf("%d%d",&m,&k);
			int st=0;
			FOR(i,0,N-1)if(str[i]=='0')st+=(1<<i);
			FOR(i,0,520)A[i]=ling[st][i];
			FOR(i,521,len-1)A[i]=0;
			FOR(i,0,N-1){
				if(str[i]=='1'){
					FOR(ji,0,k-1)B[ji]=0;
					FOR(ji,k,520)B[ji]=poly[i+1][ji];
					FOR(ji,521,len-1)B[ji]=0;
					mul();
					FOR(ji,521,len-1)A[ji]=0;
				}
			}
			int ans=0;
			FOR(i,0,m)add(ans,A[i]);
			printf("%d\n",ans);
		}
	}
}
int main(){
	work1::main();
	return 0;
}