#include <algorithm>
#include <cstdio>
#include <cstring>

namespace INPUT_SPACE {
const int S = (1 << 20) + 5;
char B[S], *H, *T;
inline int gc() {
  if (H == T) T = (H = B) + fread(B, 1, S, stdin);
  return (H == T) ? EOF : *H++;
}
inline unsigned int inn() {
  unsigned int x, ch;
  while ((ch = gc()) < '0' || ch > '9')
    ;
  x = ch ^ '0';
  while ((ch = gc()) >= '0' && ch <= '9') x = x * 10 + (ch ^ '0');
  return x;
}
}  // namespace INPUT_SPACE
using INPUT_SPACE::inn;

namespace GENERATE_VALUE_SPACE {
unsigned int _gen(unsigned int x, unsigned int A, unsigned int B, unsigned int C) {
  return A * x * x + B * x + C;
}
void gen_value(unsigned int *a, int n, unsigned int A, unsigned int B, unsigned int C,
               unsigned int a0) {
  a[1] = _gen(a0, A, B, C);
  for (int i = 2; i <= n; i++) a[i] = _gen(a[i - 1], A, B, C);
}
}  // namespace GENERATE_VALUE_SPACE
using GENERATE_VALUE_SPACE::gen_value;

#define rep(i, a, b) for (int i = (a), ed##i = (b); i <= ed##i; ++i)
#define per(i, a, b) for (int i = (a), ed##i = (b); i >= ed##i; --i)
#define re(i, a) rep (i, 1, a)
#define fio(x) freopen(x ".in", "r", stdin), freopen(x ".out", "w", stdout)

unsigned int a[7000000 + 9];
const int POL_SIZE = 6.4e7;
unsigned char pol[POL_SIZE];
int n, q;

namespace st1 {
const int sz = 800;
unsigned *add = (unsigned *)pol, *sum = (unsigned *)(pol + sizeof(pol) / 2);

inline void swap(int &x, int &y) { x ^= y, y ^= x, x ^= y; }

inline void Add(int l, int r, unsigned v) {
  if (l > r) swap(l, r);
  if (l / sz == r / sz) {
    rep (i, l, r)
      a[i] += v;
    sum[l / sz] += (r - l + 1) * v;
    return;
  }
  rep (i, l, l - l % sz + sz - 1)
    a[i] += v, sum[l / sz] += v;
  rep (i, l / sz + 1, r / sz - 1)
    sum[i] += v * sz, add[i] += v;
  rep (i, r - r % sz, r)
    a[i] += v, sum[r / sz] += v;
}

inline unsigned Ask(int l, int r) {
  if (l > r) swap(l, r);
  unsigned res = 0;
  if (l / sz == r / sz) {
    rep (i, l, r)
      res += a[i];
    return res + add[l / sz] * (r - l + 1);
  }
  rep (i, l, l - l % sz + sz - 1)
    res += a[i] + add[i / sz];
  //	fprintf(stderr,"%d\n",res);
  rep (i, l / sz + 1, r / sz - 1)
    res += sum[i];
  //	fprintf(stderr,"%d\n",res);
  rep (i, r - r % sz, r)
    res += a[i] + add[i / sz];
  return res;
}

void Main() {
  //	re(i,n)a[i]=inn();
  unsigned int A = inn(), B = inn(), C = inn(), a0 = inn();
  GENERATE_VALUE_SPACE::gen_value(a, n, A, B, C, a0);
  unsigned int last_ans = 0;
  re (i, n)
    sum[i / sz] += a[i];
  re (i, n - 1)
    inn();  // read fa
  for (int i = 1; i <= q; i++) {
    int t = inn();
    int P = last_ans & ((1 << 20) - 1);
    //		fprintf(stderr,"%d\n",t);
    if (t == 0) {
      int x = inn() ^ P, y = inn() ^ P;
      unsigned int v = inn() ^ P;
      Add(x, y, v);
    } else {
      int x = inn() ^ P, y = inn() ^ P;
      //			fprintf(stderr,"%d %d\n",x,y);
      printf("%u\n", last_ans = Ask(x, y));
    }
    //		return;
  }
}
}  // namespace st1

namespace st2 {
int *fa = (int *)pol;
unsigned char *visst = pol + sizeof(int[7000009]);
inline bool VisGet(int x) { return (visst[x / 8] >> (x % 8)) & 1; }
inline void VisSet(int x, bool y) {
  (visst[x / 8]) &= ~(1 << (x % 8));
  (visst[x / 8]) |= (int(y) << (x % 8));
}

inline void Add(int f, int t, unsigned v) {
  for (int x = f; x; x = fa[x]) VisSet(x, 1), a[x] += v;
  for (int y = t; y; y = fa[y]) {
    if (VisGet(y)) {
      for (int z = fa[y]; z; z = fa[z]) a[z] -= v;
      break;
    }
    VisSet(y, 1);
    a[y] += v;
  }
  for (int x = f; x; x = fa[x]) VisSet(x, 0);
  for (int x = t; x; x = fa[x]) VisSet(x, 0);
}

inline unsigned Ask(int f, int t) {
  unsigned res = 0;
  for (int x = f; x; x = fa[x]) VisSet(x, 1), res += a[x];
  for (int y = t; y; y = fa[y]) {
    if (VisGet(y)) {
      for (int z = fa[y]; z; z = fa[z]) res -= a[z];
      break;
    }
    VisSet(y, 1);
    res += a[y];
  }
  for (int x = f; x; x = fa[x]) VisSet(x, 0);
  for (int x = t; x; x = fa[x]) VisSet(x, 0);
  return res;
}

void Main() {
  unsigned int A = inn(), B = inn(), C = inn(), a0 = inn();
  GENERATE_VALUE_SPACE::gen_value(a, n, A, B, C, a0);
  unsigned int last_ans = 0;
  for (int i = 2; i <= n; i++) fa[i] = inn();
  for (int i = 1; i <= q; i++) {
    int t = inn();
    int P = last_ans & ((1 << 20) - 1);
    //		fprintf(stderr,"%d\n",t);
    if (t == 0) {
      int x = inn() ^ P, y = inn() ^ P;
      unsigned int v = inn() ^ P;
      Add(x, y, v);
    } else {
      int x = inn() ^ P, y = inn() ^ P;
      //			fprintf(stderr,"%d %d\n",x,y);
      printf("%u\n", last_ans = Ask(x, y));
    }
    //		return;
  }
}
}  // namespace st2

namespace st3 {
struct SmallArray {
  unsigned *st;
  inline int operator[](int x) const {
    x *= 23;
    //		fprintf(stderr,"%llu\n",((1ull*st[x/32]<<32)|st[x/32+1]));
    //		fprintf(stderr,"%d\n",(64-x%32-23));
    return (((1ull * st[x / 32] << 32) | st[x / 32 + 1]) >> (64 - x % 32 - 23)) % (1 << 23);
  }
  inline void Set(int x, int v) {
    x *= 23;
    unsigned long long msk = ~(((1ull << 23) - 1) << (64 - x % 32 - 23));
    //		fprintf(stderr,"%llu %u\n",msk,msk>>32);
    //		fprintf(stderr,"%u\n",st[0]);
    st[x / 32] &= msk >> 32;
    //		fprintf(stderr,"%u\n",st[0]);
    st[x / 32 + 1] &= unsigned(msk);
    msk = 1ull * v << (64 - x % 32 - 23);
    st[x / 32] |= msk >> 32;
    st[x / 32 + 1] |= unsigned(msk);
    //		fprintf(stderr,"%llu\n",*p);
    //		fprintf(stderr,"%u\n",st[0]);
    //		fprintf(stderr,"%u\n",st[1]);
  }
} sa, sb;
const int sz = 800;
unsigned *add, *sum;

unsigned char *visst;
inline bool VisGet(int x) { return (visst[x / 8] >> (x % 8)) & 1; }
inline void VisSet(int x, bool y) {
  (visst[x / 8]) &= ~(1 << (x % 8));
  (visst[x / 8]) |= (int(y) << (x % 8));
}

inline void swap(int &x, int &y) { x ^= y, y ^= x, x ^= y; }

inline void BlAdd(int l, int r, unsigned v) {
  if (l > r) swap(l, r);
  if (l / sz == r / sz) {
    rep (i, l, r)
      a[i] += v;
    sum[l / sz] += (r - l + 1) * v;
    return;
  }
  rep (i, l, l - l % sz + sz - 1)
    a[i] += v, sum[l / sz] += v;
  rep (i, l / sz + 1, r / sz - 1)
    sum[i] += v * sz, add[i] += v;
  rep (i, r - r % sz, r)
    a[i] += v, sum[r / sz] += v;
}

inline unsigned BlAsk(int l, int r) {
  if (l > r) swap(l, r);
  unsigned res = 0;
  if (l / sz == r / sz) {
    rep (i, l, r)
      res += a[i];
    return res + add[l / sz] * (r - l + 1);
  }
  rep (i, l, l - l % sz + sz - 1)
    res += a[i] + add[i / sz];
  //	fprintf(stderr,"%d\n",res);
  rep (i, l / sz + 1, r / sz - 1)
    res += sum[i];
  //	fprintf(stderr,"%d\n",res);
  rep (i, r - r % sz, r)
    res += a[i] + add[i / sz];
  return res;
}

inline int Tp(int x) { return VisGet(x) ? x : sa[x]; }

inline void Add(int f, int t, unsigned v) {
  while (Tp(f) != Tp(t)) {
    // fprintf(stderr, "f %d, t %d\n", f, t);
    if (sb[Tp(f)] > sb[Tp(t)]) swap(f, t);
    BlAdd(sb[Tp(t)], sb[t], v);
    t = sa[Tp(t)];
  }
  if (sb[f] > sb[t]) swap(f, t);
  BlAdd(sb[f], sb[t], v);
}

inline unsigned Ask(int f, int t) {
  unsigned res = 0;
  while (Tp(f) != Tp(t)) {
    if (sb[Tp(f)] > sb[Tp(t)]) swap(f, t);
    // fprintf(stderr, "f %d, t %d, Tp(f) %d, Tp(t) %d, df %d, dt %d\n", f, t,
    // Tp(f), Tp(t), sb[Tp(f)],
    //         sb[Tp(t)]);
    res += BlAsk(sb[Tp(t)], sb[t]);
    t = sa[Tp(t)];
  }
  if (sb[f] > sb[t]) swap(f, t);
  res += BlAsk(sb[f], sb[t]);
  return res;
}

namespace ABC {
unsigned int _gen(unsigned int x, unsigned int A, unsigned int B, unsigned int C) {
  return A * x * x + B * x + C;
}
void gen_value(unsigned int *a, int n, unsigned int A, unsigned int B, unsigned int C,
               unsigned int a0) {
  a[sb[1]] = _gen(a0, A, B, C);
  for (int i = 2; i <= n; i++) a[sb[i]] = _gen(a[sb[i - 1]], A, B, C);
}
}  // namespace ABC

void Main() {
  // fprintf(stderr, "%zu\n", sizeof(pol));
  // fprintf(stderr, "%d\n", 2 * ((n + 5) * 23 / 8) + (n / 8 + 5) + (2 * n / sz
  // + 2) * 4 * 2); return;
  sa.st = (unsigned *)pol;
  sb.st = (unsigned *)((unsigned char *)pol + ((n + 5) * 23 / 8));
  visst = (unsigned char *)sb.st + ((n + 5) * 23 / 8);
  add = (unsigned *)((unsigned char *)visst + n / 8 + 5);
  sum = (unsigned *)((unsigned char *)add + (2 * n / sz + 2) * 4);
  unsigned int A = inn(), B = inn(), C = inn(), a0 = inn();
  unsigned int last_ans = 0;
  for (int i = 2; i <= n; i++) {
    int x = inn();
    sa.Set(i, x);
  }
  per (i, n, 1) {
    // sz[i]+=1
    // sz[fa[i]]+=sz[i]
    sb.Set(i, sb[i] + 1);
    sb.Set(sa[i], sb[sa[i]] + sb[i]);
  }
  re (i, n) {
    if (sb[i] > 100) sb.Set(sa[i], i), VisSet(sa[i], 1);
  }
  re (i, n) {
    if (!VisGet(sa[i])) sb.Set(sa[i], i), VisSet(sa[i], 1);
  }
  per (i, n, 1) {
    if (sb[i] == 1) sb.Set(i, 0);
  }
  // now sb is heavy son
  // fprintf(stderr, "YES\n");
  rep (i, 2, n)
    VisSet(i, sb[sa[i]] != i);
  sb.Set(0, 0);
  VisSet(1, 1);
  int tim = 0;
  re (i, n) {
    if (!VisGet(i)) continue;
    // fprintf(stderr, "i = %d\n", i);
    int hs = 0;
    for (int j = i; j; j = hs) {
      hs = sb[j], sb.Set(j, ++tim);
      if (i != j) sa.Set(j, i);
    }
    // fprintf(stderr, "i = %d\n", i);
  }
  // return;
  // now sa=istp?fa:tp, sb=dfn
  ABC::gen_value(a, n, A, B, C, a0);
  // fprintf(stderr, "YES2\n");
  re (i, n)
    sum[i / sz] += a[i];
  for (int i = 1; i <= q; i++) {
    // fprintf(stderr, "i = %d\n", i);
    int t = inn();
    int P = last_ans & ((1 << 20) - 1);
    // fprintf(stderr, "%d\n", t);
    if (t == 0) {
      int x = inn() ^ P, y = inn() ^ P;
      // fprintf(stderr, "%d %d\n", x, y);
      unsigned int v = inn() ^ P;
      Add(x, y, v);
    } else {
      int x = inn() ^ P, y = inn() ^ P;
      // fprintf(stderr, "%d %d\n", x, y);
      printf("%u\n", last_ans = Ask(x, y));
      // fprintf(stderr, "%u\n", last_ans);
    }
    // return;
  }
}
}  // namespace st3

namespace st4 {
template <size_t T>
struct SmallArray {
  unsigned *st;
  inline int operator[](int x) const {
    x *= T;
    return (((1ull * st[x / 32] << 32) | st[x / 32 + 1]) >> (64 - x % 32 - T)) % (1 << T);
  }
  inline void Set(int x, unsigned v) {
    v %= 1 << T;
    x *= T;
    unsigned long long msk = ~(((1ull << T) - 1) << (64 - x % 32 - T));
    st[x / 32] &= msk >> 32;
    st[x / 32 + 1] &= unsigned(msk);
    msk = 1ull * v << (64 - x % 32 - T);
    st[x / 32] |= msk >> 32;
    st[x / 32 + 1] |= unsigned(msk);
  }
};
SmallArray<23> sa, sb;
SmallArray<20> a;
unsigned *add, *sum, *ops, *opx, *opy, *opz, *v, *vv, *fa, *imp, *use, *ra, *sumv, *b;
const int sz = 800;

unsigned char *visst;
inline bool VisGet(int x) { return (visst[x / 8] >> (x % 8)) & 1; }
inline void VisSet(int x, bool y) {
  (visst[x / 8]) &= ~(1 << (x % 8));
  (visst[x / 8]) |= (int(y) << (x % 8));
}

inline void swap(int &x, int &y) { x ^= y, y ^= x, x ^= y; }

inline void BlAdd(int l, int r, unsigned va, bool fl) {
  if (!fl) {
    if (l > r) swap(l, r);
    if (l / sz == r / sz) {
      rep (i, l, r)
        a.Set(i, a[i] + va);
      sum[l / sz] += (r - l + 1) * va;
      return;
    }
    rep (i, l, l - l % sz + sz - 1)
      a.Set(i, a[i] + va), sum[l / sz] += va;
    rep (i, l / sz + 1, r / sz - 1)
      sum[i] += va * sz, add[i] += va;
    rep (i, r - r % sz, r)
      a.Set(i, a[i] + va), sum[r / sz] += va;
    return;
  }
  if (l > r) swap(l, r);
  if (l / sz == r / sz) {
    rep (i, l, r)
      b[i] += va * vv[i], sum[i / sz] += va * vv[i];
    return;
  }
  rep (i, l, l - l % sz + sz - 1)
    b[i] += va * vv[i], sum[l / sz] += va * vv[i];
  rep (i, l / sz + 1, r / sz - 1)
    sum[i] += va * sumv[i], add[i] += va;
  rep (i, r - r % sz, r)
    b[i] += va * vv[i], sum[r / sz] += va * vv[i];
}

inline unsigned BlAsk(int l, int r, bool fl) {
  if (!fl) {
    if (l > r) swap(l, r);
    unsigned res = 0;
    if (l / sz == r / sz) {
      rep (i, l, r)
        res += a[i];
      return res + add[l / sz] * (r - l + 1);
    }
    rep (i, l, l - l % sz + sz - 1)
      res += a[i] + add[i / sz];
    rep (i, l / sz + 1, r / sz - 1)
      res += sum[i];
    rep (i, r - r % sz, r)
      res += a[i] + add[i / sz];
    return res;
  }
  if (l > r) swap(l, r);
  unsigned res = 0;
  if (l / sz == r / sz) {
    rep (i, l, r) {
      // fprintf(stderr, "%d %d\n", i, b[i]);
      res += b[i] + add[l / sz] * vv[i];
    }
    return res;
  }
  rep (i, l, l - l % sz + sz - 1)
    res += b[i] + add[i / sz] * vv[i];
  rep (i, l / sz + 1, r / sz - 1)
    res += sum[i];
  rep (i, r - r % sz, r)
    res += b[i] + add[i / sz] * vv[i];
  return res;
}

inline int Tp(int x) { return VisGet(x) ? x : sa[x]; }

inline void Add(int f, int t, unsigned v, bool b) {
  while (Tp(f) != Tp(t)) {
    // fprintf(stderr, "f %d, t %d\n", f, t);
    if (sb[Tp(f)] > sb[Tp(t)]) swap(f, t);
    BlAdd(sb[Tp(t)], sb[t], v, b);
    t = sa[Tp(t)];
  }
  if (sb[f] > sb[t]) swap(f, t);
  BlAdd(sb[f], sb[t], v, b);
}

inline unsigned Ask(int f, int t, bool b) {
  unsigned res = 0;
  while (Tp(f) != Tp(t)) {
    if (sb[Tp(f)] > sb[Tp(t)]) swap(f, t);
    // if (b)
    //   fprintf(stderr, "f %d, t %d, Tp(f) %d, Tp(t) %d, df %d, dt %d\n", f, t, Tp(f), Tp(t),
    //           sb[Tp(f)], sb[Tp(t)]);
    res += BlAsk(sb[Tp(t)], sb[t], b);
    t = sa[Tp(t)];
  }
  if (sb[f] > sb[t]) swap(f, t);
  res += BlAsk(sb[f], sb[t], b);
  return res;
}

namespace ABC {
unsigned int _gen(unsigned int x, unsigned int A, unsigned int B, unsigned int C) {
  return A * x * x + B * x + C;
}
void gen_value(int n, unsigned int A, unsigned int B, unsigned int C, unsigned int a0) {
  unsigned lst = 0;
  lst = _gen(a0, A, B, C);
  a.Set(sb[1], lst);
  for (int i = 2; i <= n; i++) lst = _gen(lst, A, B, C), a.Set(sb[i], lst);
}

void gen_value(unsigned int *a, int n, unsigned int A, unsigned int B, unsigned int C,
               unsigned int a0) {
  a[1] = _gen(a0, A, B, C);
  for (int i = 2; i <= n; i++) a[i] = _gen(a[i - 1], A, B, C);
}
}  // namespace ABC

// 清空内存
inline void Clear() {
  fseek(stdin, 0, SEEK_SET);
  memset(INPUT_SPACE::B, 0, sizeof INPUT_SPACE::B);
  INPUT_SPACE::H = INPUT_SPACE::T = 0;
}

inline void SP(int n) {
  per (i, n, 1) {
    // sz[i]+=1
    // sz[fa[i]]+=sz[i]
    sb.Set(i, sb[i] + 1);
    sb.Set(sa[i], sb[sa[i]] + sb[i]);
  }
  re (i, n) {
    if (sb[i] > 100) sb.Set(sa[i], i), VisSet(sa[i], 1);
  }
  re (i, n) {
    if (!VisGet(sa[i])) sb.Set(sa[i], i), VisSet(sa[i], 1);
  }
  per (i, n, 1) {
    if (sb[i] == 1) sb.Set(i, 0);
  }
  // now sb is heavy son
  // fprintf(stderr, "YES\n");
  rep (i, 2, n)
    VisSet(i, sb[sa[i]] != i);
  sb.Set(0, 0);
  VisSet(1, 1);
  int tim = 0;
  re (i, n) {
    if (!VisGet(i)) continue;
    // fprintf(stderr, "i = %d\n", i);
    int hs = 0;
    for (int j = i; j; j = hs) {
      hs = sb[j], sb.Set(j, ++tim);
      if (i != j) sa.Set(j, i);
    }
    // fprintf(stderr, "i = %d\n", i);
  }
  // now sa=istp?fa:tp, sb=dfn
}

inline void Work1() {
  ops = (unsigned *)pol;
  opx = ops + 50005;
  opy = opx + 50005;
  opz = opy + 50005;
  v = opz + 50005;
  fa = v + 300005;
  imp = fa + 300005;
  use = imp + 300005;
  visst = (unsigned char *)(use + 300005);
  sa.st = (unsigned *)((unsigned char *)visst + n / 8 + 5);
  sb.st = (unsigned *)((unsigned char *)sa.st + ((n + 5) * 23 / 8));
  add = (unsigned *)((unsigned char *)sb.st + ((n + 5) * 23 / 8));
  sum = (unsigned *)((unsigned char *)add + (2 * n / sz + 2) * 4);
  a.st = (unsigned *)((unsigned char *)sum + (2 * n / sz + 2) * 4);
  // fprintf(stderr, "%zd\n", (unsigned char *)a.st - (unsigned char *)pol);
  unsigned int A = inn(), B = inn(), C = inn(), a0 = inn();
  unsigned int last_ans = 0;
  for (int i = 2; i <= n; i++) {
    int x = inn();
    sa.Set(i, x);
  }
  SP(n);
  ABC::gen_value(n, A, B, C, a0);
  // fprintf(stderr, "YES2\n");
  re (i, n)
    sum[i / sz] += a[i];
  for (int i = 1; i <= q; i++) {
    // fprintf(stderr, "i = %d\n", i);
    int t = inn();
    ops[i] = t;
    int P = last_ans & ((1 << 20) - 1);
    // fprintf(stderr, "%d\n", t);
    if (t == 0) {
      int x = inn() ^ P, y = inn() ^ P;
      // fprintf(stderr, "%d %d\n", x, y);
      unsigned int v = inn() ^ P;
      opx[i] = x, opy[i] = y, opz[i] = v;
      Add(x, y, v, 0);
    } else {
      int x = inn() ^ P, y = inn() ^ P;
      // fprintf(stderr, "%d %d\n", x, y);
      opx[i] = x, opy[i] = y;
      last_ans = Ask(x, y, 0);
      // printf("- %u\n", last_ans);
      // fprintf(stderr, "%u\n", last_ans);
    }
    // return;
  }
}

inline int Id(int x) {
  auto it = std::lower_bound(use + 1, use + use[0] + 1, x);
  if (it == use + use[0] + 1) return 0;
  return (int)*it == x ? it - use : 0;
}

void Main() {
  Work1();
  // fprintf(stderr, "vis1: %d\n", VisGet(1));
  Clear();
  // fprintf(stderr, "vis1: %d\n", VisGet(1));
  // fprintf(stderr, "vis1: %d\n", VisGet(1));
  use[++use[0]] = 1;
  // fprintf(stderr, "vis1: %d\n", VisGet(1));
  // fprintf(stderr, "opx1: %d\n", opx[1]);
  // fprintf(stderr, "lca: %d\n", Lca(5932174, 1910562));
  int impsz = 0;
  re (i, q)
    imp[++impsz] = opx[i], imp[++impsz] = opy[i];
  std::sort(imp + 1, imp + impsz + 1);
  impsz = std::unique(imp + 1, imp + impsz + 1) - imp - 1;
  inn(), inn(), inn();
  unsigned int A = inn(), B = inn(), C = inn(), a0 = inn();
  unsigned int last_ans = 0;
  for (int i = 2; i <= n; i++) {
    int x = inn();
    sa.Set(i, x);
  }
  re (i, n)
    VisSet(i, 0);
  use[++use[0]] = 1;
  VisSet(1, 1);
  re (i, impsz) {
    use[++use[0]] = imp[i];
    if (imp[i] == 1) continue;
    int j;
    for (j = imp[i]; j && !VisGet(j); j = sa[j]) VisSet(j, 1);
    use[++use[0]] = j;
  }
  std::sort(use + 1, use + use[0] + 1);
  use[0] = std::unique(use + 1, use + use[0] + 1) - use - 1;
  // fprintf(stderr, "usesz: %d\n", use[0]);
  re (i, use[0])
    if (use[i] != 1) {
      use[++use[0]] = sa[use[i]];
      // fprintf(stderr, "find: %d\n", use[i]);
      // fprintf(stderr, "find1: %d\n", sa[use[i]]);
      // if (use[i] == 259122) fprintf(stderr, "find1: %d\n", use[i]);
    }
  // fprintf(stderr, "usesz: %d\n", use[0]);
  std::sort(use + 1, use + use[0] + 1);
  use[0] = std::unique(use + 1, use + use[0] + 1) - use - 1;
  // fprintf(stderr, "Yes\n");
  ra = sb.st;
  vv = ra + (n + 5);
  sumv = vv + 300005;
  sb.st = sumv + 300005;
  add = (unsigned *)((unsigned char *)sb.st + (300005 * 23 / 8));
  sum = (unsigned *)((unsigned char *)add + (2 * 300005 / sz + 2) * 4);
  b = (unsigned *)((unsigned char *)sum + (2 * 300005 / sz + 2) * 4);
  for (unsigned char *i = (unsigned char *)ra; i != (unsigned char *)(b + 300005); ++i) *i = 0;
  ABC::gen_value(ra, n, A, B, C, a0);
  re (i, n)
    VisSet(i, 0);
  // fprintf(stderr, "Yes\n");
  re (ii, use[0]) {
    int i = use[ii];
    v[ii] = 1;
    if (i == 1) continue;
    for (fa[ii] = sa[i]; !Id(fa[ii]); fa[ii] = sa[fa[ii]]) ++v[ii], ra[i] += ra[fa[ii]];
    fa[ii] = Id(fa[ii]);
  }
  re (i, use[0])
    sa.Set(i, fa[i]);
  SP(use[0]);
  re (i, use[0])
    b[sb[i]] = ra[use[i]], sum[sb[i] / sz] += b[sb[i]], vv[sb[i]] = v[i], sumv[sb[i] / sz] += v[i];
  for (int i = 1; i <= q; i++) {
    // fprintf(stderr, "i = %d\n", i);
    int t = inn();
    int P = last_ans & ((1 << 20) - 1);
    // fprintf(stderr, "%d\n", t);
    if (t == 0) {
      int x = inn() ^ P, y = inn() ^ P;
      // fprintf(stderr, "%d %d\n", x, y);
      x = Id(x), y = Id(y);
      if (!x) exit(-1);
      // fprintf(stderr, "%d %d\n", x, y);
      unsigned int v = inn() ^ P;
      Add(x, y, v, 1);
    } else {
      int x = inn() ^ P, y = inn() ^ P;
      // fprintf(stderr, "%d %d\n", x, y);
      x = Id(x), y = Id(y);
      if (!x) exit(-1);
      // fprintf(stderr, "x y %d %d\n", x, y);
      printf("%u\n", last_ans = Ask(x, y, 1));
    }
    // return;
  }
}
}  // namespace st4

int main() {
  // fio("problemprovidercreep");
  // fio("15");
  int subtask_id = inn();
  n = inn(), q = inn();
  if (subtask_id <= 2) {
    st2::Main();
    return 0;
  }
  if (subtask_id >= 3 and subtask_id <= 16) {
    st1::Main();
    return 0;
  }
  if (subtask_id != 23 && subtask_id != 30 && subtask_id != 37 && subtask_id != 44) {
    st3::Main();
    return 0;
  }
  st4::Main();
  return 0;
}