#include<bits/stdc++.h>
#define db double
//#define int ll
#define ll long long
#define ull unsigned long long
#define pb emplace_back
#define MP make_pair
#define pii pair<int, int>
#define fi first
#define se second
#define ls k<<1
#define rs k<<1|1
#define lowbit(i) (i&(-i))
#define CLK (double)clock()/(double)CLOCKS_PER_SEC
using namespace std;
mt19937 rnd(time(0));
inline int read(){
	register int x=0,f=1;
	register char ch=getchar();
	while(ch<'0'||ch>'9'){if(ch=='-')f=-1;ch=getchar();}
	while(ch>='0'&&ch<='9'){x=x*10+ch-'0';ch=getchar();}
	return x*f;
}
inline void write(register int x){
	if(x<0){putchar('-');x=-x;}
	if(x>9)write(x/10);
	putchar(x%10+'0');
}
const int N=2050,mod=998244353,G=3;
int rev[N];
inline int Qpow(int b,int p){
    int res=1;
    while(p){
        if(p&1)res=1ll*res*b%mod;
        b=1ll*b*b%mod;p>>=1;
    }
    return res;
}
inline void change(int *y,int n){
    for(int i=0;i<n;i++){
        rev[i]=rev[i>>1]>>1;
        if(i&1)rev[i]|=(n>>1);
    }  
    for(int i=0;i<n;i++){
        if(i<rev[i])swap(y[i],y[rev[i]]);
    }
}
inline void NTT(int *y,int n,int on){
    change(y,n);
    for(int h=2;h<=n;h<<=1){
        int gn=Qpow(G,(mod-1)/h);
        if(on==-1)gn=Qpow(gn,mod-2);
        for(int j=0;j<n;j+=h){
            int g=1;
            for(int k=j;k<j+h/2;k++){
                ll u=y[k],t=1ll*g*y[k+h/2]%mod;
                y[k]=(u+t)%mod,y[k+h/2]=(u-t+mod)%mod;
                g=1ll*g*gn%mod;
            }
        }
    }
    if(on==1)return ;
    int ivn=Qpow(n,mod-2);
    for(int i=0;i<n;i++)y[i]=1ll*y[i]*ivn%mod;
}
int n,q,p,len,a[20],b[20][N],c[20][N],A[N],B[20][N],C[N],D[N],pre[1<<15][N];
char s[53000][20];
int m[53000],k[53000];
void prework(int i,int j,int *a){
	memset(A,0,sizeof A);
	for(int k=0;k<=c[i][j]&&k*b[i][j]<=520;k++)a[k*b[i][j]]=1;
}
void work(int *C,int *A,int *B){
	NTT(A,len,1);NTT(B,len,1);
	for(int j=0;j<len;j++)C[j]=1ll*A[j]*B[j]%mod;
	NTT(A,len,-1);NTT(B,len,-1);
	NTT(C,len,-1);for(int j=521;j<len;j++)C[j]=0;
}
void MAIN(){
	n=read();q=read();p=read();len=N-2;//while(len<=N)len<<=1;
	for(int i=1;i<=n;i++){
		a[i]=read();
		for(int j=1;j<=a[i];j++)b[i][j]=read(),c[i][j]=read();
	}
	for(int i=1;i<=q;i++)scanf("%s",s[i]+1),m[i]=read(),k[i]=read();
	for(int id=1;id<=n;id++){
		B[id][0]=1;
		for(int i=1;i<=a[id];i++){
			prework(id,i,A);NTT(A,len,1);NTT(B[id],len,1);
			for(int j=0;j<len;j++)B[id][j]=1ll*B[id][j]*A[j]%mod;
			NTT(B[id],len,-1);for(int j=521;j<len;j++)B[id][j]=0;
		}
//		for(int j=0;j<10;j++)cout<<B[id][j]<<' ';cout<<"\n";
		memcpy(pre[1<<(id-1)],B[id],sizeof B[id]);
	}
//	for(int i=0;i<=520;i++)cout<<B[1][i]<<' ';cout<<"\n";
	int tot=(1<<n)-1;
if(n<=2){
	for(int S=0;S<=tot;S++){
		if(S==0){pre[S][0]=1;continue;}
//		cout<<S<<' '<<lowbit(S)<<"\n";
		if(S!=lowbit(S))work(pre[S],pre[S^lowbit(S)],pre[lowbit(S)]);
//		for(int j=0;j<10;j++)cout<<pre[S][j]<<' ';cout<<"\n";
	}
}
	for(int _=1;_<=q;_++){
		int S=0;
		for(int id=1;id<=n;id++)if(s[_][id]=='0')S|=1<<(id-1);
		memcpy(D,pre[S],sizeof pre[S]);
//		for(int j=0;j<10;j++)cout<<D[j]<<' ';cout<<"\n";
		for(int id=1;id<=n;id++){
			if(s[_][id]=='0')continue;
			for(int j=0;j<len;j++)C[j]=B[id][j];
			for(int j=0;j<k[_];j++)C[j]=0;
			NTT(C,len,1);NTT(D,len,1);
			for(int j=0;j<len;j++)D[j]=1ll*D[j]*C[j]%mod;
			NTT(D,len,-1);for(int j=521;j<len;j++)D[j]=0;
		}
		int res=0;
		for(int i=0;i<=m[_];i++)(res+=D[i])%=mod;
//		for(int i=0;i<=m[_];i++)if(D[i])cout<<i<<' '<<D[i]<<"\n";
		cout<<res<<"\n";
	}
}
signed main(){
//	freopen("a.in","r",stdin);
//	freopen("a.out","w",stdout);
    int T=1;while(T--)MAIN();
//  printf("\nTIME:%lf\n",(double)clock()/CLOCKS_PER_SEC);
	return 0;
}