#include <bits/stdc++.h>
#define fo(i,a,b) for(int i=a;i<=b;++i)
#define fd(i,a,b) for(int i=a;i>=b;--i)
#define max(a,b) ((a)>(b)?(a):(b))
#define min(a,b) ((a)<(b)?(a):(b))
#define LL long long
#define mo 998244353
#define N 1200005
#define ad(x,y) x+=y,x-=(x>=mo?mo:0)
using namespace std;
int read()
{
	int x=0,x1=0;char ch=getchar();
	while(!isdigit(ch))x1|=(ch=='-'),ch=getchar();
	while(isdigit(ch))x=(x<<3)+(x<<1)+ch-'0',ch=getchar();
	return (x1?-x:x);
}
int r[N];
LL ksm(LL x,int y)
{
	if(!y)return 1;
	LL z=ksm(x,y>>1);
	return((y&1)?z*z%mo*x%mo:z*z%mo);
}
struct poly{
	vector<int> a;
	void ntt(int x,int inv)
	{
		fo(i,0,x)r[i]=(i&1)*(x>>1)+(r[i>>1]>>1);
		fo(i,0,x-1)if(i>r[i])swap(a[i],a[r[i]]);
		for(int len=2;len<=x;len<<=1)
		{
			LL mi=len>>1,zqr=ksm(3,(mo-1)/len);
			if(inv<0)zqr=ksm(zqr,mo-2);
			for(int wz=0;wz<x;wz+=len)
			{ 
				LL zq=1;
				fo(k,1,mi)
				{
					LL ji=1ll*a[wz+mi+k-1]*zq%mo;
					a[wz+mi+k-1]=a[wz+k-1]-ji;
					a[wz+mi+k-1]+=(a[wz+mi+k-1]<0?mo:0);
					a[wz+k-1]+=ji;
					a[wz+k-1]-=(a[wz+k-1]>=mo?mo:0);
					zq=1ll*zq*zqr%mo;
				}
			}
		}
		if(inv<0)
		{
			LL nm=ksm(x,mo-2);
			fo(i,0,x-1)a[i]=1ll*a[i]*nm%mo;
		}
	}
	void res(int x)
	{
		a.resize(x);
	}
	friend poly operator *(poly A,poly B)
	{
		int x=1,tp=A.a.size()+B.a.size()-1;
		while(x<tp)x<<=1;
		A.res(x),B.res(x);
		A.ntt(x,1);B.ntt(x,1);
		fo(i,0,x-1)A.a[i]=1ll*A.a[i]*B.a[i]%mo;
		A.ntt(x,-1);
		A.res(tp);
		return A;
	}
};
int n,mid;
poly an[16],an1[525][33],an2[525][33];
bool vis1[525][33],vis2[525][33];
void cal1(int k,int zt)
{
	poly ans;
	fo(i,1,mid)
	{
		poly b=an[i];
		if(zt&(1<<i-1))fo(j,0,k-1)b.a[j]=0;
		if(ans.a.empty())ans=b;
		else ans=ans*b,ans.res(521); 
	}
	vis1[k][zt]=1;an1[k][zt]=ans;
}
void cal2(int k,int zt)
{
	poly ans;ans.a={1};
	fo(i,mid+1,n)
	{
		poly b=an[i];
		if(zt&(1<<i-mid-1))fo(j,0,k-1)b.a[j]=0;
		if(ans.a.empty())ans=b;
		else ans=ans*b,ans.res(521); 
	}
	vis2[k][zt]=1;an2[k][zt]=ans;
}
int main()
{
	n=read();mid=n>>1;
	int q=read();read();
	fo(i,1,n)
	{
		poly f;
		f.a={1};
		int nu=read();
		fo(j,1,nu)
		{
			int x=read(),y=read();
			poly a;a.res(521);
			fo(j,0,520)if(j/x<=y&&j%x==0)a.a[j]=1;
			else a.a[j]=0;
			f=f*a;
			f.res(521);
		}
		an[i]=f;
	}
	while(q--)
	{
		char c[20];scanf("%s",c+1);
		int m=read(),k=read(),zt1=0,zt2=0;
		fo(i,1,mid)zt1|=(1<<i-1)*(c[i]^48);
		if(!vis1[k][zt1])cal1(k,zt1);
		fo(i,mid+1,n)zt2|=(1<<i-mid-1)*(c[i]^48);
		if(!vis2[k][zt2])cal2(k,zt2);
		int ans=0,su=0;
		fo(i,0,m)ad(su,an1[k][zt1].a[i]),ad(ans,1ll*su*an2[k][zt2].a[m-i]%mo);
		printf("%d\n",ans);
	}
	return 0;
}