#include<bits/stdc++.h>
#define M 20005
#define mid ((l+r)>>1)
using namespace std;
struct IO {
    static const int inSZ = 1 << 17;
    char inBuf[inSZ], *in1, *in2;
    template<class T> inline __attribute((always_inline))
    T read() {
        if (in1 > inBuf + inSZ - 32) [[unlikely]] {
            auto len = in2 - in1;
            memcpy(inBuf, in1, len);
            in1 = inBuf, in2 = inBuf + len;
            in2 += fread(in2, 1, inSZ - len, stdin);
            if (in2 != inBuf + inSZ) *in2 = 0;
        }
        T res = 0;
        unsigned char c;
        while ((c = *in1++) < 48);
        while (res = res * 10 + (c - 48), (c = *in1++) >= 48);
        return res;
    }
    static const int outSZ = 1 << 21;
    char outBuf[outSZ], *out;
    template<class T> inline __attribute((always_inline))
    void write(T x) {
        if (out > outBuf + outSZ - 32) [[unlikely]]
            fwrite(outBuf, 1, out - outBuf, stdout), out = outBuf;
        if (!x) return *out++ = 48, void();
        if (x < 0) *out++ = 45, x = -x;
        alignas(2) const char* digits =
        "0001020304050607080910111213141516171819"
        "2021222324252627282930313233343536373839"
        "4041424344454647484950515253545556575859"
        "6061626364656667686970717273747576777879"
        "8081828384858687888990919293949596979899";
        alignas(64) static char buf[20];
        char* p = buf + 20;
        while (x >= 10) memcpy(p -= 2, digits + x % 100 * 2, 2), x /= 100;
        if (x) *--p = 48 + x;
        auto len = buf + 20 - p;
        memcpy(out, p, len), out += len;
    }
    void init() {
        in1 = in2 = inBuf + inSZ;
        out = outBuf;
    }
    ~IO() { fwrite(outBuf, 1, out - outBuf, stdout); }
} IO;
template<class T = int> T read() {
    return IO.read<T>();
}
template<class... Args> void read(Args&... args) {
    ((args = IO.read<Args>()), ...);
}
template<class T> void write(T x, char c = '\n') {
    IO.write(x), *IO.out++ = c;
}
int n,q,c,m,s[M],o[M];
unsigned long long B,A[M];
struct node{
    unsigned long long a[64]; 
    bool x[64];

}a[M],sm[M<<2];
node add(const node &b,const node &a){
    node ans({});
    memcpy(ans.x, a.x, sizeof(a.x));
    for(int i=0;i<=63;++i){
        for(int j=0;j<=63;++j)
            if((a.a[i]>>j)&1) ans.a[i]^=b.a[j],ans.x[i]^=b.x[j];
    }
    return ans;
}
node cj(){
    node ans({});
    for(int i=0;i<=63;++i){
        ans.x[i]=((B>>i)&1);
        for(int j=1;j<=m;++j){
            if(((A[j]>>i)&1)&&o[j]==0){ans.x[i]^=1;continue;}
            if((!((A[j]>>i)&1))&&o[j]==1) continue;
            if(i>=s[j]) ans.a[i]^=(1ll<<(i-s[j]));
            else ans.a[i]^=(1ll<<(64+i-s[j]));
        }
    }
    return ans;
}
void build(int p,int l,int r){
    if(l==r){sm[p]=a[l];return ;}
    build(p<<1,l,mid);build(p<<1|1,mid+1,r);
    sm[p]=add(sm[p<<1],sm[p<<1|1]);
}
node ck(int p,int l,int r,int L,int R){
    if(L<=l&&r<=R) return sm[p];
    if(L>mid) return ck(p<<1|1,mid+1,r,L,R);
    if(R<=mid) return ck(p<<1,l,mid,L,R);
    return add(ck(p<<1,l,mid,L,R),ck(p<<1|1,mid+1,r,L,R));
}
void cg(int p,int l,int r,int pos){
    if(l==r){sm[p]=a[l];return;}
    if(pos<=mid) cg(p<<1,l,mid,pos);
    else cg(p<<1|1,mid+1,r,pos);
    sm[p]=add(sm[p<<1],sm[p<<1|1]);
}
void print(node a){
    for(int i=0;i<=63;++i) printf("%llu ",a.a[i]);
    printf("\n");
    // for(int i=0;i<=63;++i) printf("%d ",a.x[i]);
    // printf("\n");
}
int main(){
    IO.init();
    n = read(), q = read(), read();
    for(int i=1;i<=n;++i){
        m = read();
        for(int j=1;j<=m;++j) s[j] = read(), o[j] = read(), read(A[j]);
        read(B);
        a[i]=cj();
        // print(a[i]);
    }
    build(1,1,n);
    int op,i,l,r;
    unsigned long long x;
    while(q--){
        read(op);
        if(op){
            i=read();
            m=read();
            for(int j=1;j<=m;++j) s[j] = read(), o[j] = read(), read(A[j]);
            read(B);
            a[i]=cj();
            cg(1,1,n,i);
        }
        else{
            l=read(),r=read(),read(x);
            node ans=ck(1,1,n,l,r);
            // print(ans);
            unsigned long long as=0;
            for(int i=0;i<=63;++i){
                bool nw=ans.x[i];
                nw^=((__builtin_popcountll(ans.a[i]&x))&1);
                if(nw) as|=(1ll<<i);
            }
            printf("%llu\n",as);
        }
    }
    return 0;
}