#include <bits/stdc++.h>
using namespace std;

#define all(x) begin(x), end(x)
#ifdef CKISEKI
#include <experimental/iterator>
#define safe cerr<<__PRETTY_FUNCTION__<<" line "<<__LINE__<<" safe\n"
#define debug(a...) debug_(#a, a)
#define orange(a...) orange_(#a, a)
void debug_(auto s, auto ...a) {
  cerr << "\e[1;32m(" << s << ") = (";
  int f = 0;
  (..., (cerr << (f++ ? ", " : "") << a));
  cerr << ")\e[0m\n";
}
void orange_(auto s, auto L, auto R) {
  cerr << "\e[1;33m[ " << s << " ] = [ ";
  using namespace experimental;
  copy(L, R, make_ostream_joiner(cerr, ", "));
  cerr << " ]\e[0m\n";
}
#else
#define safe ((void)0)
#define debug(...) safe
#define orange(...) safe
#endif

using llu = uint64_t;

struct Affine {
  uint64_t M[64];
  uint64_t C;
  Affine() : M{}, C(0) {
    for (int i = 0; i < 64; i++)
      M[i] = 1ULL << i;
  }
  uint64_t apply(uint64_t x) {
    uint64_t res = C;
    for (int i = 0; i < 64; i++)
      if (x >> i & 1)
        res ^= M[i];
    return res;
  }
};

Affine op(const Affine &lhs, const Affine &rhs) {
  Affine res;

  for (int i = 0; i < 64; i++)
    res.M[i] = 0;
  for (int i = 0; i < 64; i++)
    for (int j = 0; j < 64; j++)
      if (lhs.M[i] >> j & 1)
        res.M[i] ^= rhs.M[j];

  res.C = rhs.C;
  for (int i = 0; i < 64; i++)
    if (lhs.C >> i & 1)
      res.C ^= rhs.M[i];
  return res;
}

struct Segtree {
};

Affine make_affine(llu B, int m, const auto &s, const auto &o, const auto &A) {
  auto f = [&](llu X) {
    llu res = B;
    for (int j = 0; j < m; j++) {
      llu Y;
      if (s[j] == 0)
        Y = X;
      else
        Y = (X << s[j]) | (X >> (64 - s[j]));

      if (o[j] == 0) {
        res ^= Y | A[j];
      } else {
        res ^= Y & A[j];
      }
    }
    return res;
  };
  auto f0 = f(0);

  Affine ret;
  ret.C = f0;
  for (int i = 0; i < 64; i++) {
    auto fi = f(1ULL << i);
    ret.M[i] = fi ^ f0;
  }
  return ret;
}

int main() {
  cin.tie(nullptr)->sync_with_stdio(false);
  int N, Q, C;
  cin >> N >> Q >> C;

  vector<Affine> st(N * 2);
  for (int i = 0; i < N; i++) {
    int m;
    cin >> m;
    vector<llu> s(m), A(m);
    vector<int> o(m);

    for (int j = 0; j < m; j++) {
      cin >> s[j] >> o[j] >> A[j];
    }
    llu B;
    cin >> B;

    st[i + N] = make_affine(B, m, s, o, A);
  }

  for (int i = N - 1; i > 0; i--)
    st[i] = op(st[i << 1], st[i << 1 | 1]);

  while (Q--) {
    int t;
    cin >> t;
    if (t == 0) {
      int l, r;
      llu x;
      cin >> l >> r >> x;
      --l;

      vector<int> sl, sr;
      for (l += N, r += N; l < r; l >>= 1, r >>= 1) {
        if (l & 1) sl.push_back(l++);
        if (r & 1) sr.push_back(--r);
      }

      for (int i : sl)
        x = st[i].apply(x);
      for (int i : sr | views::reverse)
        x = st[i].apply(x);
      cout << x << '\n';
    } else {
      int l;
      cin >> l;
      --l;

      int m;
      cin >> m;
      vector<llu> s(m), A(m);
      vector<int> o(m);

      for (int j = 0; j < m; j++) {
        cin >> s[j] >> o[j] >> A[j];
      }
      llu B;
      cin >> B;

      st[l + N] = make_affine(B, m, s, o, A);
      for (l += N; l >>= 1;)
        st[l] = op(st[l << 1], st[l << 1 | 1]);
    }
  }

  return 0;
}