// 哈哈，不认识“娃”这个字了。

#include <bits/stdc++.h>
using namespace std;

typedef long long ll;
typedef vector<int> vint;

int read() {
	int a = 0, b = 0; char c = getchar();
	while (c < '0' || c > '9') b ^= (c == '-'), c = getchar();
	while (c >= '0' && c <= '9') a = a * 10 - 48 + c, c = getchar();
	return b ? -a : a;
}

const int N = 15, V = 1024, Vp = 521;
const int mod = 998244353, G = 3, iG = 332748118;
int n, q, f[N][V], vf[N][Vp][V];
void Add(int &a, int b) { if ((a += b) >= mod) a -= mod; }
void Sub(int &a, int b) { if ((a -= b) < 0) a += mod; }
int add(int a, int b) { return (a + b >= mod) ? a + b - mod : a + b; }
int sub(int a, int b) { return a - b < 0 ? a - b + mod : a - b; }
void Fav(int &a, int b, int c) { a = (a + (ll)b * c) % mod; }
void Mul(int &a, int b) { a = (ll)a * b % mod; }
int mul(int a, int b) { return (ll)a * b % mod; }
int pw(ll a, int k) { ll s = 1; while (k) { if (k & 1) s = s * a % mod; a = a * a % mod; k >>= 1; } return s; }

int rv[V];

void init() {
	for (int i = 1; i < V; ++i) rv[i] = (rv[i >> 1] >> 1) | ((i & 1) ? (V >> 1) : 0);
}


void NTT(int f[], int ag = 1) {
	for (int i = 0; i < V; ++i) if (i < rv[i]) swap(f[i], f[rv[i]]);
	for (int k = 2; k <= V; k <<= 1) {
		int rk = k >> 1, w = pw(G, (mod - 1) / k);
		for (int i = 0; i < V; i += k) {
			int r = 1;
			for (int j = i; j < i + rk; ++j) {
				int g = mul(f[j + rk], r);
				f[j + rk] = sub(f[j], g);
				Add(f[j], g);
				
				Mul(r, w);
			}
		}
	}
	if (!ag) {
		int iV = pw(V, mod - 2);
		reverse(f + 1, f + V);
		for (int i = 0; i < V; ++i) Mul(f[i], iV);
	}
}



void mulp(int f[], int g[]) {
	static int h[V];
	memset(h, 0, sizeof h);
	for (int v1 = 0; v1 < V; ++v1) {
		for (int v2 = 0; v1 + v2 < V; ++v2) {
			Fav(h[v1 + v2], f[v1], g[v2]);
		}
	}
	for (int i = 0; i < V; ++i) cout << g[i] << ' '; cout << '\n';
	for (int i = 0; i < V; ++i) cout << f[i] << ' '; cout << '\n';
	for (int i = 0; i < V; ++i) cout << h[i] << ' '; cout << '\n';
	NTT(g);
	NTT(f);
	for (int i = 0; i < V; ++i) Mul(g[i], f[i]);
	NTT(g, 0);
	NTT(f, 0);
	for (int i = 0; i < V; ++i) cout << g[i] << ' '; cout << '\n';
	cout << '\n';
}

int main() {
//	freopen("a.in", "r", stdin);
//	freopen("a.out", "w", stdout);
	init();
	n = read(), q = read();
	read();
	// mod = read();
	for (int i = 0; i < n; ++i) {
		int a = read();
		f[i][0] = 1;
		for (int r = 0; r < a; ++r) {
			int b = read(), c = read();
			static int g[V];
			for (int k = 0; k < Vp; ++k) g[k] = add(f[i][k], (k >= b ? g[k - b] : 0));
			for (int k = 0; k < Vp; ++k) f[i][k] = sub(g[k], (k >= b * (c + 1) ? g[k - b * (c + 1)] : 0));
		}
		memcpy(vf[i][0], f[i], V << 2);
		for (int k = 0; k < Vp - 1; ++k) {
			memcpy(vf[i][k + 1] + k + 1, vf[i][k] + k + 1, (V - k - 1) << 2);
			NTT(vf[i][k]);
		}
		 NTT(vf[i][520]);
	}
	for (int i = 0; i < q; ++i) {
		char s[20];
		int m, k, v = 0;
		scanf("%s%d%d", s, &m, &k);
		for (int j = 0; j < n; ++j) if (s[j] == '1') v |= 1 << j;
		int lw = k * __builtin_popcount(v);
		if (lw > m) {
			cout << 0 << '\n';
			continue;
		}
		static int g[V];
		/*
		memset(g, 0, V << 2);
		g[0] = 1;
		for (int j = 0; j < n; ++j) {
			if ((v >> j) & 1) {
				mulp(vf[j][k], g);
			} else {
				mulp(vf[j][0], g);
			}
		}
		*/
		
		for (int i = 0; i < V; ++i) g[i] = 1;
		for (int j = 0; j < n; ++j) {
			if ((v >> j) & 1) {
				for (int i = 0; i < V; ++i) Mul(g[i], vf[j][k][i]);
			} else {
				for (int i = 0; i < V; ++i) Mul(g[i], vf[j][0][i]);
			}
		}
		NTT(g, 0);
		int ans = 0;
		for (int j = 0; j <= m; ++j) Add(ans, g[j]);
		cout << ans << '\n';
	}
	return 0;
}