#include <bits/stdc++.h>
namespace IO {
#define iL (1 << 20)
char ibuf[iL], *iS = ibuf + iL, *iT = ibuf + iL;
#define gc() ((iS == iT) ? (iT = (iS = ibuf) + fread(ibuf, 1, iL, stdin), iS == iT ? EOF : *iS ++) : *iS ++)
template<class T> inline void read(T &x) {
	x = 0;int f = 0;char ch = gc();
	for (; !isdigit(ch); f |= ch == '-', ch = gc());
	for (; isdigit(ch); x = (x << 1) + (x << 3) + (ch ^ 48), ch = gc());
	x = (f == 1 ? ~ x + 1 : x);
}
template<class T, class... Args> inline void read(T &x, Args&... args) { read(x), read(args...); }
template<class T> inline void readch(T &x) { char ch = gc(); for (; !isdigit(ch); ch = gc()); x = ch; }
char Out[iL], *iter = Out;
#define flush() fwrite(Out, 1, iter - Out, stdout), iter = Out
template<class T> inline void write(T x, char ch = '\n') {
	T l, c[35];
	if (x < 0) *iter ++ = '-', x = ~ x + 1;
	for (l = 0; !l || x; c[l] = x % 10, l++, x /= 10);
	for (; l; -- l, *iter ++ = c[l] + '0');*iter ++ = ch;
	flush();
}
} // IO
using namespace IO;
#define N 20
#define M 525
#define ll long long
#define DEBUG
#define pii pair<int, int>
#define mp make_pair
#define fi first
#define se second
#define vi vector<int>
using namespace std;
int n, q, p, answ[M * 100]; vi f[N], g[N][M], sf[M], sg[M]; vi ansf[M][(1 << 6)]; 
vector<pair<pii, int> > qry[M];
namespace poly {
	int l, rev[M * 10];
	int qpow(int a, int b) { int r = 1; while (b) { if (b & 1) r = 1ll * r * a % p; a = 1ll * a * a % p, b >>= 1; } return r; }
	void init(int n) {
		l = 1; int s = 0; while (l < n) l <<= 1, s ++;
		for (int i = 0; i < l; i++) rev[i] = (rev[i >> 1] >> 1) | ((i & 1) << s - 1);
	}
	inline void ntt(vi &f, int l, int on) {
		f.resize(l);
		for (int i = 0; i < l; i++) if (rev[i] > i) swap(f[i], f[rev[i]]);
		for (int h = 2; h <= l; h <<= 1) {
			int wn = qpow(3, (p - 1) / h); if (on == -1) wn = qpow(wn, p - 2);
			for (int i = 0; i < l; i += h) for (int j = 0, w = 1; j < h / 2; j++, w = 1ll * w * wn % p) {
				int u = f[i + j], t = 1ll * w * f[i + j + h / 2] % p;
				f[i + j] = (u + t > p) ? u + t - p : u + t;
				f[i + j + h / 2] = (u - t < 0) ? u - t + p : u - t;
			}
		}
		if (on == -1) { int in = qpow(l, p - 2); 
		for (int i = 0; i < l; i++) f[i] = 1ll * f[i] * in % p; }
	}
	inline vi conv(vi a, vi b) {
		int n = a.size(), m = b.size();
		if (n == 0 || m == 0) return vi{};
		if (n < 30 || m < 30) {
			vi r = {}; if (n > m) swap(a, b), swap(n, m); r.resize(n + m - 1);
			for (int i = 0; i < n + m - 1; i++) {
				for (int j = 0; j <= i && j < n; j++) r[i] = 1ll * (r[i] + 1ll * a[j] * b[i - j] % p) % p;
			}
			r.resize(M);
			return r;
		}
		int sz = n + m - 1; init(sz);
		ntt(a, l, 1), ntt(b, l, 1); for (int i = 0; i < l; i++) a[i] = 1ll * a[i] * b[i] % p;
		ntt(a, l, -1); vi r; r.resize(M); for (int i = 0; i < min(sz, M); i++) r[i] = a[i];
		return r;
	}
}
int main() {
#ifndef ONLINE_JUDGE
	freopen("test.in", "r", stdin); freopen("test.out", "w", stdout);
#endif
	read(n, q, p);
	for (int i = 1, len; i <= n; i++) {
		read(len); f[i] = {1};
		for (int j = 1, b, c; j <= len; j++) { read(b, c);
			int l = 1; vi prod; prod.resize(min(M, c * b + 1));
			for (int k = 0; k < min(M, c * b + 1); k += b) prod[k] = 1;
			f[i] = poly::conv(f[i], prod);
		}
	}
	for (int k = 1; k < M; k++) {
		for (int i = 1; i <= n; i++) {
			g[i][k] = f[i]; 
			if (g[i][k].size() < k) vi().swap(g[i][k]);
			else { for (int j = 0; j < k; j++) g[i][k][j] = 0; }
		}
	}
	for (int k = 1; k < M; k++) {
		for (int s = 0; s < (1 << n); s++) {
			ansf[k][s] = {1};
			for (int i = 1; i <= n; i++) {
				if ((s >> i - 1) & 1) ansf[k][s] = poly::conv(ansf[k][s], g[i][k]);
				else ansf[k][s] = poly::conv(ansf[k][s], f[i]);
				ansf[k][s].resize(M);
			}
		}
	}
	for (int _ = 1; _ <= q; _++) {
		int s = 0, m, k;
		for (int i = 1, l = 1, x; i <= n; i++) readch(x), s += l * (x - '0'), l <<= 1;
		read(m, k); ll res = 0; ansf[k][s].resize(M);
		for (int i = 0; i <= m; i++) res = (res + ansf[k][s][i]) % p;
		write(res);
	}
	return 0;
}