#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;
const int N=2050,mod=998244353,inv3=(mod+1)/3;
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;
}
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;}
int f[16][521],ans[16][521][521],pd[521][521],n,q;
int rev[N],a[N],b[N],c[N],d[N];
V ntt(int *a,int len,int op) {
	fo(i,0,len-1) if(i<rev[i]) swap(a[i],a[rev[i]]);
	for(int i=1;i<len;i<<=1) {
		ll g=ksm(op?3:inv3,(mod-1)/(i<<1));
		for(int j=0;j<len;j+=(i<<1)) {
			ll g0=1;
			fo(k,0,i-1) {
				ll x=a[j+k],y=a[i+j+k]*g0%mod;
				a[j+k]=(x+y)%mod;
				a[i+j+k]=(x-y+mod)%mod;
				g0=g0*g%mod;
			}
		}
	}
	if(!op) {
		ll inv=ksm(len,mod-2);
		fo(i,0,len-1) a[i]=a[i]*inv%mod;
	}
}
V mul(int *x,int *y,int *z) {
	int s1(0),s2(0);
	fo(i,0,520) {
		if(x[i]) s1++;
		a[i]=x[i];
	}
	fo(i,0,520) {
		if(y[i]) s2++;
		b[i]=y[i];
	}
	if(s1*s2<=2048*33) {
		vi id1,id2;fo(i,0,520) {if(a[i])id1.pb(i);if(b[i])id2.pb(i);z[i]=0;}
		for(int i:id1) for(int j:id2) if(i+j<=520) z[i+j]=(z[i+j]+1ll*a[i]*b[j])%mod;
		return ;
	}
	int len=1024;
	fo(i,512,len-1) a[i]=b[i]=0;
	ntt(a,len,1);ntt(b,len,1);
	fo(i,0,len-1) a[i]=1ll*a[i]*b[i]%mod;
	ntt(a,len,0);
	fo(i,0,520) z[i]=a[i];
	fo(i,512,520) fo(j,0,520-i) z[i+j]=(z[i+j]+1ll*x[i]*y[j])%mod;
	fo(i,512,520) fo(j,0,520-i) z[i+j]=(z[i+j]+1ll*y[i]*x[j])%mod;
}
char Ed;
int main() {
//	freopen("doll.in","r",stdin);
//	freopen("doll.out","w",stdout); 
	cerr<<"memory:"<<(&St-&Ed)/1024.0<<endl;
	int len=1024;
	fo(i,0,len-1) rev[i]=(rev[i>>1]>>1)|(i&1?(len>>1):0);
	n=read();q=read();read();
	fo(i,1,n) {
		int s=read();
		f[i][0]=1;
		fo(j,1,s) {
			int a=read(),b=read();
			memset(c,0,sizeof(c));
			fo(k,0,b) if(k*a<=520) c[k*a]=1;
			mul(f[i],c,f[i]);
		}
	}
	while(q--) {
		string t;int m,k,sum(0);
		cin>>t;m=read();k=read();
		int ST(0);
		fo(i,0,t.length()-1) ST=(ST<<1)|(t[i]-'0');
		if(pd[ST][k]) {
			fo(i,0,m) sum=(sum+ans[ST][k][i])%mod;
			printf("%d\n",sum);
			continue;
		}
		ans[ST][k][0]=1;
		fo(i,1,n) {
			if(t[i-1]=='0') mul(ans[ST][k],f[i],ans[ST][k]);
			else {
				fo(j,0,520) d[j]=j<k?0:f[i][j];
				mul(ans[ST][k],d,ans[ST][k]);
			}
		}
		pd[ST][k]=1;
		fo(i,0,m) sum=(sum+ans[ST][k][i])%mod;
		printf("%d\n",sum);
	}
	cerr<<"time:"<<clock()<<endl;
	return 0;
}