#include<bits/stdc++.h>
#define gc getchar_unlocked
template<typename Ty>
inline Ty read() {
   Ty x = 0; int c = gc(); bool f = false;
   while (! isdigit(c)) f |= c == '-', c = gc();
   while (isdigit(c)) x = x * 10 + (c ^ 48), c = gc();
   return f ? -x : x;
}
using ull = unsigned long long;
inline ull shift(ull x, int y) {
   if (! y) return x;
   return (x << y) | (x >> 64 - y);
}
const int maxn = 2e4 + 10;
int n;
struct node_t {
   ull a[64], k;
   inline node_t() {
      memset(a, 0, sizeof(a)), k = 0;
   }
   inline void init() {
      *this = node_t();
      int m = read<int>();
      while (m--) {
         int x = read<int>(), op = read<int>();
         ull val = read<ull>();
         if (op == 0) {
            k ^= val, val = ~ val;
         }
         a[x] = val;
      }
      k ^= read<ull>();
   }
   inline node_t operator * (const node_t &b) const {
      node_t c;
      c.k = b.k;
      for (int i = 0; i < 64; i++) {
         c.k ^= shift(k, i) & a[i];
         for (int j = 0; j < 64; j++) {
            c.a[(i + j) & 63] ^= shift(a[i], j) & b.a[j];
         }
      }
      return c;
   }
   inline ull operator () (const ull &x) const {
      ull y = k;
      for (int i = 0; i < 64; i++) {
         y ^= shift(x, i) & a[i];
      }
      return y;
   }
} tr[maxn * 4];
inline void build(int k = 1, int l = 1, int r = n) {
   if (l == r) {
      return tr[k].init(), void();
   }
   int mid = l + r >> 1;
   build(k << 1, l, mid), build(k << 1 | 1, mid + 1, r);
   tr[k] = tr[k << 1] * tr[k << 1 | 1];
}
inline void update(int x, int k = 1, int l = 1, int r = n) {
   if (l == r) {
      return tr[k].init(), void();
   }
   int mid = l + r >> 1;
   if (x <= mid) update(x, k << 1, l, mid);
   else update(x, k << 1 | 1, mid + 1, r);
   tr[k] = tr[k << 1] * tr[k << 1 | 1];
}
inline void query(int x, int y, ull &z, int k = 1, int l = 1, int r = n) {
   if (l == r) {
      return z = tr[k](z), void();
   }
   int mid = l + r >> 1;
   if (x <= mid) query(x, y, z, k << 1, l, mid);
   if (y  > mid) query(x, y, z, k << 1 | 1, mid + 1, r);
}
int main() {
   n = read<int>();
   int q = read<int>(), c = read<int>();
   build();
   while (q--) {
      int op = read<int>(), x = read<int>();
      if (op == 0) {
         int y = read<int>(); ull z = read<ull>();
         query(x, y, z);
         printf("%llu\n", z);
      } else {
         update(x);
      }
   }
}