#include<bits/stdc++.h>
#define ld long double
#define ci const int 
#define ll long long
#define fo(i,l,r) for(int i=(l);i<=(r);++i)
#define fu(i,l,r) for(int i=(l);i<(r);++i)
#define fd(i,l,r) for(int i=(l);i>=(r);--i)
#define P(x) __builtin_popcount(x)
#define gcd(x,y) __gcd(x,y)
using namespace std;
ci mod=998244353,N=1e6+5;
const ld eps=1e-9;
void _(int &a,int b){a=(a+b)%mod;}
mt19937 rad(chrono::steady_clock::now().time_since_epoch().count());
inline ll read(){ll u=0,f=1;char o;while((o=getchar())<48||o>57)if(o=='-')f=-1;u=(o^48);while((o=getchar())>=48&&o<=57)u=(u<<1)+(u<<3)+(o^48);return u*f;}
void write(ll x){if(x<0)putchar('-'),x=-x;if(x>9)write(x/10);putchar(x%10+48);}
bool ST;
int n,q,a[16];
int b[16][550],c[16][550];
namespace solve4
{
	int f[16][525],qz[525];
	char ch[N];
	bool ty[N];
	int main()
	{
		while(q--)
		{
			scanf("%s",ch+1);
			ll m=read(),k=read();
			memset(f,0,sizeof(f));
			f[0][0]=1;
			bool F=0;
			fo(i,1,n)
			{
				ty[i]=ch[i]-'0';
				ll num=c[i][1];
				if(ty[i])
				{
					if(b[i][1]*c[i][1]<k)
					{
						F=1;
						break;
					}
					ll up=(k+b[i][1]-1)/b[i][1];
					m-=up*b[i][1];
					if(m<0)break;
					num-=up;
				}
//				cout<<i<<' '<<b[i][1]<<' '<<num<<'\n';
//				fo(j,0,m)cout<<f[i-1][j]<<' ';cout<<'\n';
				fo(j,0,m)
				{
					qz[j]=f[i-1][j];
					if(j>=b[i][1])_(qz[j],qz[j-b[i][1]]);
					f[i][j]=qz[j];
					if(j>=b[i][1]*(num+1))_(f[i][j],-qz[j-b[i][1]*(num+1)]);
				}
			}
			int ans=0;
			if(!F&&m>=0)
			{
				fo(i,0,m)_(ans,f[n][i]);
			}
			cout<<(ans+mod)%mod<<'\n';
		}
		return 0;
	}
}
bool ED;
signed main()
{cerr<<(&ST-&ED)/1048576.0<<'\n';
//	freopen("1.in","r",stdin);
//	freopen("1.out","w",stdout);
//	freopen("doll.in","r",stdin);
//	freopen("doll.out","w",stdout);
	n=read();q=read();read();
	bool F=0;
	fo(i,1,n)
	{
		a[i]=read();
		fo(j,1,a[i])b[i][j]=read(),c[i][j]=read();
		if(a[i]!=1)F=1;
	}
	if(!F)return solve4::main();
/*	while(q--)
	{
		
	}*/
}