#include <cstdio>
#include <iostream>
#include <algorithm>
#include <cstring>
#include <vector>
using namespace std;
#define fi first
#define sc second
#define mkp make_pair
#define pii pair<int,int>
typedef long long ll;
#define pll pair<ll,ll>
const int N=550,L=520,oo=1e9,mod=998244353,G=3,invG=(mod+1)/3;
inline int read() {
    int x=0,flag=0;char ch=getchar();
    while(ch<'0'||ch>'9') {flag|=(ch=='-');ch=getchar();}
    while('0'<=ch&&ch<='9') {x=(x<<3)+(x<<1)+ch-'0';ch=getchar();}
    return flag?-x:x;
}
inline int mx(int x,int y) {return x>y?x:y;}
inline int mn(int x,int y) {return x<y?x:y;}
inline void swp(int &x,int &y) {x^=y^=x^=y;}
inline int as(int x) {return x>0?x:-x;}

int n,q,m,f[N],g[N],sum[N],M[52105],dn[52105];
char s[N];
namespace POLY { 
    struct Po {
        int f[N<<2];
    }A,B,C;
    inline int ksm(int a,int b=mod-2) {
        int ans=1;
        while(b) {
            if(b&1) ans=1ll*ans*a%mod;
            a=1ll*a*a%mod;
            b>>=1;
        }
        return ans;
    }
    int tr[N<<2],gg[2][25][N<<2],lim;
    unsigned long long F[N<<2];
    inline void NTT(int*f,int lim,int op) {
        for(int i=0;i<lim;++i)
            if(i<tr[i]) swp(f[i],f[tr[i]]);
        for(int i=0;i<lim;++i) F[i]=f[i];
        for(int p=2,t=0;p<=lim;p<<=1,++t) {
            int len=p>>1;
            for(int k=0;k<lim;k+=p) {
                int now;
                for(int i=0;i<len;++i) {
                    now=1ll*F[k|i|len]*gg[op][t][i]%mod;
                    F[k|i|len]=F[k|i]-now+mod;
                    F[k|i]+=now;
                }
            }
            if(t==4) 
                for(int i=0;i<lim;++i) F[i]%=mod;
        }
        for(int i=0;i<lim;++i) f[i]=F[i]%mod;
        if(!op) {
            int invn=ksm(lim);
            for(int i=0;i<lim;++i) f[i]=1ll*f[i]*invn%mod;
        }
    }
    inline void prep() {
        lim=1;
        while(lim<=2*L+1) lim<<=1;
        for(int i=0;i<lim;++i) tr[i]=((tr[i>>1]>>1)|((i&1)?lim>>1:0));
    }
    inline Po operator *(Po x,Po y) {
        NTT(x.f,lim,1); NTT(y.f,lim,1);
        for(int i=0;i<lim;++i) x.f[i]=1ll*x.f[i]*y.f[i]%mod;
        NTT(x.f,lim,0);
        for(int i=L+1;i<lim;++i) x.f[i]=0;
        return x;
    }
    Po H[20],P[(1<<15)+5],Ans[52105];
}using namespace POLY;
int val[(1<<15)+5],len[(1<<15)+5],kk[20],ans[52105];
vector< pii > qry[N];
int main() {
#ifndef ONLINE_JUDGE
    freopen("a.in","r",stdin);
    freopen("a.out","w",stdout);
#endif
    n=read();q=read();read();
    for(int i=0;i<n;++i) {
        m=read();
        f[0]=1;
        for(int j=1;j<=L;++j) f[j]=0;
        int qaq=0;
        for(int j=1,x,y;j<=m;++j) {
            x=read();y=read();
            qaq=mn(qaq+x*y,L+1);
            sum[0]=1;
            for(int p=1;p<=L;++p) {
                sum[p]=f[p];
                if(p>=x) sum[p]=(sum[p]+sum[p-x])%mod;
                if(p>=x*(y+1)) sum[p]=(sum[p]-f[p-x*(y+1)]+mod)%mod;
                g[p]=sum[p];
            }
            for(int p=1;p<=L;++p) f[p]=g[p];
        }
        kk[i]=qaq;
        for(int j=0;j<=L;++j) H[i].f[j]=f[j];
    }
    for(int i=0,p=2;i<=20;++i,p<<=1) {
        gg[0][i][0]=gg[1][i][0]=1;
        gg[0][i][1]=ksm(invG,(mod-1)/p),
        gg[1][i][1]=ksm(G,(mod-1)/p);
        for(int j=2;j<=(L<<2);++j) 
            gg[0][i][j]=1ll*gg[0][i][j-1]*gg[0][i][1]%mod,
            gg[1][i][j]=1ll*gg[1][i][j-1]*gg[1][i][1]%mod;
    }
    prep();
    P[0].f[0]=1;
    for(int i=1,pos;i<(1<<n);++i) {
        pos=0;
        for(int j=0;j<n;++j)
            if((i>>j)&1) {
                pos=j;
                break;
            }
        P[i]=H[pos]*P[i^(1<<pos)];
        pos=i;
        while(pos) {
            ++len[i];
            pos-=pos&-pos;
        }
    }
    int maxn=0;
    for(int i=1,S;i<=q;++i)  {
        scanf("%s",s);
        M[i]=read();dn[i]=read();
        S=0; bool fl=0;
        for(int j=0;j<n;++j)
            if(s[j]=='0') S|=(1<<j);
            else {
                if(kk[j]<dn[i]) {
                    fl=1;break;
                }
            }
        if(fl) continue;
        Ans[i]=P[S];
        for(int j=1;j<=L;++j)
            Ans[i].f[j]=(Ans[i].f[j-1]+Ans[i].f[j])%mod;
        if(((1<<n)-1)^S) {
            qry[dn[i]].push_back(mkp(((1<<n)-1)^S,i));
            maxn=mx(maxn,dn[i]);
        } else {
            ans[i]=Ans[i].f[M[i]];
        }
    }
    for(int V=1;V<=maxn;++V) {
        for(int i=1;i<(1<<n);++i) {
            val[i]=1;
            for(int j=0;j<n;++j)
                if((i>>j)&1)val[i]=1ll*val[i]*H[j].f[V-1]%mod;
            if(len[i]&1) val[i]=(mod-val[i])%mod;
        }
        for(int i=(1<<n)-1;i>=1;--i) {
            for(int t=(i-1)&i;;t=(t-1)&i) {
                for(int p=(V-1)*len[i^t];p<=L;++p) 
                    P[i].f[p]=(P[i].f[p]+1ll*P[t].f[p-(V-1)*len[i^t]]*val[i^t])%mod;
                if(t==0) break;
            }
        }
        for(auto&now:qry[V]) 
            for(int j=0;j<=M[now.sc];++j)
                ans[now.sc]=(ans[now.sc]+1ll*Ans[now.sc].f[j]*P[now.fi].f[M[now.sc]-j])%mod;
    }
    for(int i=1;i<=q;++i) 
        printf("%d\n",ans[i]);
    return 0;
}