#include <bits/stdc++.h>
#define rep(i,j,k) for(int i=(j);i<=(k);i++)
#define per(i,j,k) for(int i=(j);i>=(k);i--)
#define uint unsigned int
#define ll long long
#define ull unsigned long long
#define db double
#define ldb long double
#define pii pair<int,int>
#define pll pair<ll,ll>
#define mkp make_pair
#define eb emplace_back
#define SZ(S) (int)S.size()
#define mod 998244353
//#define mod 1000000007
#define inf 0x3f3f3f3f
#define linf 0x3f3f3f3f3f3f3f3f
using namespace std;

template <class T>
void chkmax(T &x,T y){
    if(x < y) x = y;
}

template <class T>
void chkmin(T &x,T y){
    if(x > y) x = y;
}

inline int popcnt(int x){
    return __builtin_popcount(x);
}

inline int ctz(int x){
    return __builtin_ctz(x);
}

template <int P>
class mod_int
{
    using Z = mod_int;

private:
    static int mo(int x) { return x < 0 ? x + P : x; }

public:
    int x;
    int val() const { return x; }
    mod_int() : x(0) {}
    template <class T>
    mod_int(const T &x_) : x(x_ >= 0 && x_ < P ? static_cast<int>(x_) : mo(static_cast<int>(x_ % P))) {}
    bool operator==(const Z &rhs) const { return x == rhs.x; }
    bool operator!=(const Z &rhs) const { return x != rhs.x; }
    Z operator-() const { return Z(x ? P - x : 0); }
    Z pow(long long k) const
    {
        Z res = 1, t = *this;
        while (k)
        {
            if (k & 1)
                res *= t;
            if (k >>= 1)
                t *= t;
        }
        return res;
    }
    Z &operator++()
    {
        x < P - 1 ? ++x : x = 0;
        return *this;
    }
    Z &operator--()
    {
        x ? --x : x = P - 1;
        return *this;
    }
    Z operator++(int)
    {
        Z ret = x;
        x < P - 1 ? ++x : x = 0;
        return ret;
    }
    Z operator--(int)
    {
        Z ret = x;
        x ? --x : x = P - 1;
        return ret;
    }
    Z inv() const { return pow(P - 2); }
    Z &operator+=(const Z &rhs)
    {
        (x += rhs.x) >= P && (x -= P);
        return *this;
    }
    Z &operator-=(const Z &rhs)
    {
        (x -= rhs.x) < 0 && (x += P);
        return *this;
    }
    Z operator-()
    {
        return -x;
    }
    Z &operator*=(const Z &rhs)
    {
        x = 1ULL * x * rhs.x % P;
        return *this;
    }
    Z &operator/=(const Z &rhs) { return *this *= rhs.inv(); }
#define setO(T, o)                                  \
    friend T operator o(const Z &lhs, const Z &rhs) \
    {                                               \
        Z res = lhs;                                \
        return res o## = rhs;                       \
    }
    setO(Z, +) setO(Z, -) setO(Z, *) setO(Z, /)
#undef setO
    
    friend istream& operator>>(istream& is, mod_int& x)
    {
        long long tmp;
        is >> tmp;
        x = tmp;
        return is;
    }
    friend ostream& operator<<(ostream& os, const mod_int& x)
    {
        os << x.val();
        return os;
    }
};

using Z = mod_int<mod>;
Z power(Z p,ll k){
    Z ans = 1;
    while(k){
        if(k % 2 == 1) ans *= p;
        p *= p;
        k /= 2;
    }
    return ans;
}
int n,m,q,type;
Z val[15][525],tmp[525];

struct qry{
    int msk,id,op;
};
vector <qry> SS[525];
Z result[52105][525];
Z answer[52105];

Z dp[1 << 15][525];
char str[233];
int main(){
//    freopen("test.in","r",stdin);
    scanf("%d%d%d",&n,&q,&type);
    m = 520;
    rep(i,0,n - 1){
        int p,w,lim;
        scanf("%d",&p);
        val[i][0] = 1;
        rep(j,1,p){
            scanf("%d%d",&w,&lim);
            rep(k,0,m){
                tmp[k] = val[i][k];
                if(k >= w) tmp[k] += tmp[k - w];
            }
            rep(k,0,m){
                val[i][k] = tmp[k];
                if(k >= (lim + 1) * w) val[i][k] -= tmp[k - (lim + 1) * w];
            }
        }
//        rep(k,0,10) printf("%d ",val[i][k].val());
//        printf("\n");
    }

    rep(i,1,q){
        scanf("%s",str);
        int _m,_k,msk = 0;
        scanf("%d%d",&_m,&_k);
        rep(j,0,n - 1) if(str[j] == '1') msk |= 1 << j;
        SS[_k].push_back({msk,i,0});
        SS[0].push_back({(1 << n) - 1 - msk,i,_m});
    }
    dp[0][0] = 1;
    per(i,m,0){
        rep(p,0,n - 1){
            rep(S,1,(1 << n) - 1){
                if(((S >> p) & 1) == 0) continue;
                rep(k,popcnt(S) * i,m) dp[S][k] += dp[S - (1 << p)][k - i] * val[p][i];
            }
        }


        for(qry I:SS[i]){
            if(!I.op){
                rep(k,0,m){
                    result[I.id][k] = dp[I.msk][k];
                    if(k) result[I.id][k] += result[I.id][k - 1];
                }
//                printf("fnd %d\n",I.id);
//                rep(k,0,100) printf("%d ",result[I.id][k].val());
//                printf("\n");
                continue;   
            }
            rep(k,0,I.op) answer[I.id] += result[I.id][I.op - k] * dp[I.msk][k];
        }
    }
    rep(i,1,q) printf("%d\n",answer[i].val());
	return 0;
}