#include <cassert>
#include <cmath>
#include <cstdint>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <algorithm>
#include <bitset>
#include <complex>
#include <deque>
#include <functional>
#include <iostream>
#include <limits>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <sstream>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>

using namespace std;

using Int = long long;

template <class T1, class T2> ostream &operator<<(ostream &os, const pair<T1, T2> &a) { return os << "(" << a.first << ", " << a.second << ")"; };
template <class T> ostream &operator<<(ostream &os, const vector<T> &as) { const int sz = as.size(); os << "["; for (int i = 0; i < sz; ++i) { if (i >= 256) { os << ", ..."; break; } if (i > 0) { os << ", "; } os << as[i]; } return os << "]"; }
template <class T> void pv(T a, T b) { for (T i = a; i != b; ++i) cerr << *i << " "; cerr << endl; }
template <class T> bool chmin(T &t, const T &f) { if (t > f) { t = f; return true; } return false; }
template <class T> bool chmax(T &t, const T &f) { if (t < f) { t = f; return true; } return false; }
#define COLOR(s) ("\x1b[" s "m")

////////////////////////////////////////////////////////////////////////////////
template <unsigned M_> struct ModInt {
  static constexpr unsigned M = M_;
  unsigned x;
  constexpr ModInt() : x(0U) {}
  constexpr ModInt(unsigned x_) : x(x_ % M) {}
  constexpr ModInt(unsigned long long x_) : x(x_ % M) {}
  constexpr ModInt(int x_) : x(((x_ %= static_cast<int>(M)) < 0) ? (x_ + static_cast<int>(M)) : x_) {}
  constexpr ModInt(long long x_) : x(((x_ %= static_cast<long long>(M)) < 0) ? (x_ + static_cast<long long>(M)) : x_) {}
  ModInt &operator+=(const ModInt &a) { x = ((x += a.x) >= M) ? (x - M) : x; return *this; }
  ModInt &operator-=(const ModInt &a) { x = ((x -= a.x) >= M) ? (x + M) : x; return *this; }
  ModInt &operator*=(const ModInt &a) { x = (static_cast<unsigned long long>(x) * a.x) % M; return *this; }
  ModInt &operator/=(const ModInt &a) { return (*this *= a.inv()); }
  ModInt pow(long long e) const {
    if (e < 0) return inv().pow(-e);
    ModInt a = *this, b = 1U; for (; e; e >>= 1) { if (e & 1) b *= a; a *= a; } return b;
  }
  ModInt inv() const {
    unsigned a = M, b = x; int y = 0, z = 1;
    for (; b; ) { const unsigned q = a / b; const unsigned c = a - q * b; a = b; b = c; const int w = y - static_cast<int>(q) * z; y = z; z = w; }
    assert(a == 1U); return ModInt(y);
  }
  ModInt operator+() const { return *this; }
  ModInt operator-() const { ModInt a; a.x = x ? (M - x) : 0U; return a; }
  ModInt operator+(const ModInt &a) const { return (ModInt(*this) += a); }
  ModInt operator-(const ModInt &a) const { return (ModInt(*this) -= a); }
  ModInt operator*(const ModInt &a) const { return (ModInt(*this) *= a); }
  ModInt operator/(const ModInt &a) const { return (ModInt(*this) /= a); }
  template <class T> friend ModInt operator+(T a, const ModInt &b) { return (ModInt(a) += b); }
  template <class T> friend ModInt operator-(T a, const ModInt &b) { return (ModInt(a) -= b); }
  template <class T> friend ModInt operator*(T a, const ModInt &b) { return (ModInt(a) *= b); }
  template <class T> friend ModInt operator/(T a, const ModInt &b) { return (ModInt(a) /= b); }
  explicit operator bool() const { return x; }
  bool operator==(const ModInt &a) const { return (x == a.x); }
  bool operator!=(const ModInt &a) const { return (x != a.x); }
  friend std::ostream &operator<<(std::ostream &os, const ModInt &a) { return os << a.x; }
};
////////////////////////////////////////////////////////////////////////////////


int N, Q, P;
vector<int> A;
vector<vector<int>> B, C;
vector<int> S, M, K;

template <unsigned MO> void run() {
  using Mint = ModInt<MO>;
  const int maxM = *max_element(M.begin(), M.end());
  static Mint F[15][530];
  memset(F, 0, sizeof(F));
  for (int i = 0; i < N; ++i) {
    F[i][0] = 1;
    for (int j = 0; j < A[i]; ++j) {
      // (1 - x^(b(c+1))) / (1 - x^b)
      for (int k = maxM - B[i][j] * (C[i][j] + 1); k >= 0; --k) {
        F[i][k + B[i][j] * (C[i][j] + 1)] -= F[i][k];
      }
      for (int k = 0; k <= maxM - B[i][j]; ++k) {
        F[i][k + B[i][j]] += F[i][k];
      }
    }
// cerr<<"F["<<i<<"] = ";pv(F[i],F[i]+13);
  }
  
  vector<vector<int>> qss(maxM + 1);
  for (int q = 0; q < Q; ++q) {
    qss[min(K[q], maxM)].push_back(q);
  }
  static Mint want[53000][530];
  
  vector<int> pop(1 << N, 0);
  for (int i = 0; i < N; ++i) for (int h = 0; h < 1 << i; ++h) pop[h | 1 << i] = pop[h] + 1;
  static Mint gss[1 << 15][530];
  memset(gss, 0, sizeof(gss));
  gss[0][0] = 1;
// int cost0=0,cost1=0;
  for (int k = maxM; k >= 0; --k) {
    // add [x^k]
    for (int i = 0; i < N; ++i) {
      const Mint f = F[i][k];
      for (int h0 = 0; h0 < 1 << N; h0 += 2 << i) for (int h = h0; h < h0 + (1 << i); ++h) {
        const int hh = h | 1 << i;
        const int low = pop[hh] * k + pop[hh >> (i + 1)];
// cost0+=1;cost1+=max(maxM-low+1,0);
        for (int l = low; l <= maxM; ++l) {
          // gss[hh][l] += gss[h][l - k] * f;
          gss[hh][l].x = (gss[hh][l].x + (Int)gss[h][l - k].x * f.x) % MO;
        }
      }
    }
    for (const int q : qss[k]) {
      copy(gss[S[q]], gss[S[q]] + (maxM + 1), want[q]);
    }
  }
// cerr<<"cost0 = "<<cost0<<", cost1 = "<<cost1<<endl;
  // 1 / (1 - x)
  for (int h = 0; h < 1 << N; ++h) {
    for (int k = 0; k <= maxM - 1; ++k) {
      gss[h][k + 1] += gss[h][k];
    }
  }
  
  for (int q = 0; q < Q; ++q) {
    Mint ans = 0;
// cerr<<"want[q] = ";pv(want[q],want[q]+13);
    const int h = (1 << N) - 1 - S[q];
    for (int k = 0; k <= M[q]; ++k) {
      ans += gss[h][M[q] - k] * want[q][k];
    }
    printf("%u\n", ans.x);
  }
}

int main() {
  char buf[20];
  
  for (; ~scanf("%d%d%d", &N, &Q, &P); ) {
    A.resize(N);
    B.resize(N);
    C.resize(N);
    for (int i = 0; i < N; ++i) {
      scanf("%d", &A[i]);
      B[i].resize(A[i]);
      C[i].resize(A[i]);
      for (int j = 0; j < A[i]; ++j) {
        scanf("%d%d", &B[i][j], &C[i][j]);
      }
    }
    S.assign(Q, 0);
    M.resize(Q);
    K.resize(Q);
    for (int q = 0; q < Q; ++q) {
      scanf("%s%d%d", buf, &M[q], &K[q]);
      for (int i = 0; i < N; ++i) {
        S[q] |= (buf[i] - '0') << i;
      }
    }
    
    if (P == 998244353) {
      run<998244353>();
    } else {
      run<1'000'000'007>();
    }
  }
  return 0;
}