#include <bits/stdc++.h>
#define lowbit(x) (x & -x)
#define eb emplace_back
#define pb push_back
#define mp make_pair
using namespace std;

typedef unsigned long long ll;
const int N = 20005;
const int B = 200;
const int Mod = 998244353;

int n, q, c;
int loc[N], L[N], R[N];
int s[64], o[64];
ll A[64], BB;

struct f {
    bool b[64];
    ll c[64];

    inline ll calc(ll x) {
        ll ret = 0;
        for (int i = 0; i < 64; i++)
            ret |= (ll(b[i] ^ (__builtin_popcountll(x & c[i]) & 1)) << i);
        return ret;
    }
} H[N], F[N / B + 2], sf[N], pf[N];

inline f merge(const f &A, const f &B) {//A after B
    f r;
    for (int i = 0; i < 64; i++) {
        r.c[i] = 0;
        r.b[i] = A.b[i];
        for (int j = 0; j < 64; j++) if ((A.c[i] >> j) & 1)
            r.c[i] ^= B.c[j], r.b[i] ^= B.b[j];
    }
    return r;
}

inline void rebuild(int id) {
    int l = L[id], r = R[id];
    F[id] = H[l];
    pf[l] = H[l];
    for (int i = l + 1; i <= r; i++) {
        F[id] = merge(H[i], F[id]);
        pf[i] = merge(H[i], pf[i - 1]);
    }
    sf[r] = H[r];
    for (int i = r - 1; i >= l; i--) sf[i] = merge(sf[i + 1], H[i]);
}

inline void read(f &a) {
    int m;
    scanf("%d", &m);
    for (int i = 1; i <= m; i++) scanf("%d", &s[i]), scanf("%d", &o[i]), scanf("%llu", &A[i]);
    scanf("%llu", &BB);

    for (int i = 0; i < 64; i++) {
        a.b[i] = (BB >> i) & 1;
        a.c[i] = 0;
        for (int j = 1; j <= m; j++) {
            int x = (i - s[j] + 64) % 64;
            if (o[j] == 0 && (A[j] >> i & 1)) a.b[i] ^= 1;
            else if (o[j] == 1 && !(A[j] >> i & 1)) ;
            else a.c[i] |= (ll(1) << x);
        }
    }
}

int main() {
    scanf("%d%d%d", &n, &q, &c);

    for (int i = 1; i <= n; i++) {
        loc[i] = i / B + 1;
        if (loc[i] != loc[i - 1]) L[loc[i]] = i;
        R[loc[i]] = i;
    }

    for (int i = 1; i <= n; i++) read(H[i]);

    for (int i = 1; i <= loc[n]; i++) rebuild(i);

    while (q--) {
        int op, l, r; ll x;
        scanf("%d", &op);
        if (op == 0) {
            scanf("%d%d%llu", &l, &r, &x);
            int lb = loc[l], rb = loc[r];
            if (lb == rb) {
                for (int i = l; i <= r; i++) x = H[i].calc(x);
                printf("%llu\n", x);
            } else {
                x = sf[l].calc(x);
                for (int i = lb + 1; i < rb; i++) x = F[i].calc(x);
                x = pf[r].calc(x);
                printf("%llu\n", x);
            }
        } else {
            scanf("%d", &l);
            read(H[l]);
            rebuild(loc[l]);
        }
    }
    return 0;
}
/*
 3 1 1
 1 4 0 0 51966
 2 0 0 15 61 1 4095 46681
 1 0 0 16 15
 0 1 3 2023
*/