#include<bits/stdc++.h>

using namespace std;

struct SqrtTreeItem {
    array<uint64_t, 64> arr;
    uint64_t xr = 0;

    SqrtTreeItem() {
        arr.fill(0);
        xr = 0;
    }
};

SqrtTreeItem op(const SqrtTreeItem &a, const SqrtTreeItem &b) {
    SqrtTreeItem res;
    res.xr = b.xr;
    for (int i = 0; i < 64; ++i) {
        for (int j = 0; j < 64; ++j) {
            if (b.arr[i] >> j & 1) {
                res.xr ^= (a.xr >> j & 1) << i;
                res.arr[i] ^= a.arr[j];
            }
        }
    }
    return res;
}

inline int log2Up(int n) {
    int res = 0;
    while ((1 << res) < n) {
        res++;
    }
    return res;
}

const int N = 4e4;
const int K = 6;

int n;
SqrtTreeItem v[N];
int clz[N], layers[N], onLayer[N];
int sz_layers = 0;
SqrtTreeItem pref[K][N], suf[K][N], between[K][N];
int lg, indexSz;

inline void buildBlock(int, int, int);
inline void buildBetween(int, int, int, int);
inline void buildBetweenZero();
inline void buildBetweenZero(int);
void build(int, int, int, int);
void update(int, int, int, int, int);


inline void buildBlock(int layer, int l, int r) {
    pref[layer][l] = v[l];
    for (int i = l + 1; i < r; i++) {
        pref[layer][i] = op(pref[layer][i - 1], v[i]);
    }
    suf[layer][r - 1] = v[r - 1];
    for (int i = r - 2; i >= l; i--) {
        suf[layer][i] = op(v[i], suf[layer][i + 1]);
    }
}

inline void buildBetween(int layer, int lBound, int rBound, int betweenOffs) {
    int bSzLog = (layers[layer] + 1) >> 1;
    int bCntLog = layers[layer] >> 1;
    int bSz = 1 << bSzLog;
    int bCnt = (rBound - lBound + bSz - 1) >> bSzLog;
    for (int i = 0; i < bCnt; i++) {
        SqrtTreeItem ans;
        for (int j = i; j < bCnt; j++) {
            SqrtTreeItem add = suf[layer][lBound + (j << bSzLog)];
            ans = (i == j) ? add : op(ans, add);
            between[layer - 1][betweenOffs + lBound + (i << bCntLog) + j] = ans;
        }
    }
}

inline void buildBetweenZero() {
    int bSzLog = (lg + 1) >> 1;
    for (int i = 0; i < indexSz; i++) {
        v[n + i] = suf[0][i << bSzLog];
    }
    build(1, n, n + indexSz, (1 << lg) - n);
}

inline void updateBetweenZero(int bid) {
    int bSzLog = (lg + 1) >> 1;
    v[n + bid] = suf[0][bid << bSzLog];
    update(1, n, n + indexSz, (1 << lg) - n, n + bid);
}

void build(int layer, int lBound, int rBound, int betweenOffs) {
    if (layer >= sz_layers) {
        return;
    }
    int bSz = 1 << ((layers[layer] + 1) >> 1);
    for (int l = lBound; l < rBound; l += bSz) {
        int r = min(l + bSz, rBound);
        buildBlock(layer, l, r);
        build(layer + 1, l, r, betweenOffs);
    }
    if (layer == 0) {
        buildBetweenZero();
    } else {
        buildBetween(layer, lBound, rBound, betweenOffs);
    }
}

void update(int layer, int lBound, int rBound, int betweenOffs, int x) {
    if (layer >= sz_layers) {
        return;
    }
    int bSzLog = (layers[layer] + 1) >> 1;
    int bSz = 1 << bSzLog;
    int blockIdx = (x - lBound) >> bSzLog;
    int l = lBound + (blockIdx << bSzLog);
    int r = min(l + bSz, rBound);
    buildBlock(layer, l, r);
    if (layer == 0) {
        updateBetweenZero(blockIdx);
    } else {
        buildBetween(layer, lBound, rBound, betweenOffs);
    }
    update(layer + 1, l, r, betweenOffs, x);
}

inline SqrtTreeItem query(int l, int r, int betweenOffs, int base) {
    if (l == r) {
        return v[l];
    }
    if (l + 1 == r) {
        return op(v[l], v[r]);
    }
    int layer = onLayer[clz[(l - base) ^ (r - base)]];
    int bSzLog = (layers[layer] + 1) >> 1;
    int bCntLog = layers[layer] >> 1;
    int lBound = (((l - base) >> layers[layer]) << layers[layer]) + base;
    int lBlock = ((l - lBound) >> bSzLog) + 1;
    int rBlock = ((r - lBound) >> bSzLog) - 1;
    SqrtTreeItem ans = suf[layer][l];
    if (lBlock <= rBlock) {
        SqrtTreeItem add = (layer == 0) ? (
                query(n + lBlock, n + rBlock, (1 << lg) - n, n)
        ) : (
                                   between[layer - 1][betweenOffs + lBound + (lBlock << bCntLog) + rBlock]
                           );
        ans = op(ans, add);
    }
    ans = op(ans, pref[layer][r]);
    return ans;
}

inline SqrtTreeItem query(int l, int r) {
    return query(l, r, 0, 0);
}

inline void update(int x) {
    update(0, 0, n, 0, x);
}

void build() {
    lg = log2Up(n);
    clz[0] = 0;
    for (int i = 1; i < 1 << lg; i++) {
        clz[i] = clz[i >> 1] + 1;
    }
    int tlg = lg;
    while (tlg > 1) {
        onLayer[tlg] = sz_layers;
        layers[sz_layers++] = tlg;
        tlg = (tlg + 1) >> 1;
    }
    for (int i = lg - 1; i >= 0; i--) {
        onLayer[i] = max(onLayer[i], onLayer[i + 1]);
    }
    int betweenLayers = max(0, sz_layers - 1);
    int bSzLog = (lg + 1) >> 1;
    int bSz = 1 << bSzLog;
    indexSz = (n + bSz - 1) >> bSzLog;
    build(0, 0, n, 0);
}


int main() {
    cin.tie(nullptr)->sync_with_stdio(false);

    int q, c;
    cin >> n >> q >> c;
    for (int i = 0; i < n; ++i) {
        int m;
        cin >> m;
        vector<tuple<int, int, uint64_t>> res(m);
        for (auto &[s, o, A]: res) cin >> s >> o >> A;
        cin >> v[i].xr;
        for (int j = 0; j < 64; ++j) {
            for (auto [s, o, A]: res) {
                int k = j + s;
                if (k >= 64) k -= 64;
                if (o == 0 && (A >> k & 1)) v[i].xr ^= 1ull << k;
                else if (o == 1 && (~A >> k & 1)) {}
                else {
                    v[i].arr[k] ^= 1ull << j;
                }
            }
        }
    }
    build();
    while (q--) {
        int op;
        cin >> op;
        if (op == 0) {
            int l, r;
            uint64_t x;
            cin >> l >> r >> x;
            --l, --r;
            auto v = query(l, r);
            uint64_t res = v.xr;
            for (int j = 0; j < 64; ++j) {
                for (int k = 0; k < 64; ++k) {
                    if (v.arr[j] >> k & 1) {
                        res ^= (x >> k & 1) << j;
                    }
                }
            }
            cout << res << '\n';
        } else {
            int i;
            cin >> i;
            --i;
            v[i] = SqrtTreeItem();
            int m;
            cin >> m;
            vector<tuple<int, int, uint64_t>> res(m);
            for (auto &[s, o, A]: res) cin >> s >> o >> A;
            cin >> v[i].xr;
            for (int j = 0; j < 64; ++j) {
                for (auto [s, o, A]: res) {
                    int k = j + s;
                    if (k >= 64) k -= 64;
                    if (o == 0 && (A >> k & 1)) v[i].xr ^= 1ull << k;
                    else if (o == 1 && (~A >> k & 1)) {}
                    else {
                        v[i].arr[k] ^= 1ull << j;
                    }
                }
            }
            update(i);
        }
    }
}