#include<bits/stdc++.h>
using namespace std;
#define ull unsigned long long
inline char nc()
{
	static char buf[99999],*l,*r;
	return l==r&&(r=(l=buf)+fread(buf,1,99999,stdin),l==r)?EOF:*l++;
}
template <class code>inline code read(const code &a)
{
    code x=0;short w=0;char ch=0;
    while(!isdigit(ch)) {w|=ch=='-';ch=getchar();}
    while(isdigit(ch)) {x=(x<<3)+(x<<1)+(ch^48);ch=getchar();}
    return w?-x:x;
}
void print(int x){
	if(x<0)putchar('-'),x=-x;
	if(x>=10)print(x/10);
	putchar(x%10+48);
}
const int g1=3,gi=332748118,mod=998244353,maxn=1024,inv=997269505;
int n,m,rev[maxn+5],a[maxn+5],dp[20][maxn+5],f[maxn+5],b[20][maxn+5],c[20][maxn+5],za[maxn+5],zb[maxn+5],qwq[maxn+5];
char s[maxn+5];
int add(int x){
    return x>=mod?x-mod:x;
}
int ksm(int x,int y){
    int now=1;
    while(y){
        if(y&1)now=1ll*now*x%mod;
        x=1ll*x*x%mod;
        y>>=1;
    }
    return now;
}
void NTT(int *g,bool op,int n){
  static ull f[maxn<<1],w[maxn<<1]={1};
  for(int i=0;i<n;i++)f[i]=g[rev[i]];
  for(int l=1;l<n;l<<=1){
    ull tG=ksm(op?g1:gi,(mod-1)/(l+l));
    for (int i=1;i<l;i++)w[i]=w[i-1]*tG%mod;
    for(int k=0;k<n;k+=l+l)
      for(int p=0;p<l;p++){
        int tt=w[p]*f[k|l|p]%mod;
        f[k|l|p]=f[k|p]+mod-tt;
        f[k|p]+=tt;
      }
  }if (!op){
    ull invn=ksm(n,mod-2);
    for(int i=0;i<n;++i)
      g[i]=f[i]%mod*invn%mod;
  }else for(int i=0;i<n;++i)g[i]=f[i]%mod;
}
void cl(int *a,int *b,int n){
    NTT(a,1,n);NTT(b,1,n);
    for(int i=0;i<n;i++)a[i]=1ll*a[i]*b[i]%mod;
    NTT(a,0,n);
}
signed main()
{
    int n=read(n),q=read(q),p=read(p);
    if(n>2)return 0;
    for(int i=0;i<maxn;i++)rev[i]=(rev[i>>1]>>1)|((i&1)?maxn>>1:0);
    for(int i=1;i<=n;i++){
        a[i]=read(a[i]);
        dp[i][0]=1;  
        for(int j=1;j<=a[i];j++){
            b[i][j]=read(b[i][j]),c[i][j]=read(c[i][j]);
            memset(f,0,sizeof(f));
            for(int k=0;k<=c[i][j]&&k*b[i][j]<maxn;k++)f[k*b[i][j]]=1;
            cl(dp[i],f,maxn);
        }
    }
    while(q--){
        int m,k;
        scanf("%s %d %d",s+1,&m,&k);
        memset(f,0,sizeof(f));
        f[0]=1;
        for(int i=1;i<=n;i++){
            memcpy(qwq,dp[i],sizeof(dp[i]));
            if(s[i]=='1')for(int j=0;j<k;j++)qwq[j]=0;
            cl(f,qwq,maxn);
        }
        int ans=0;
        for(int j=0;j<=m;j++)ans=add(ans+f[j]);
        printf("%d\n",ans);
    }
	return 0;
}