#include <bits/stdc++.h>
using namespace std;
int k;
struct modvec {
  int a[31];
  modvec(int x = 0) {
    memset(a, 0, sizeof(a));
    int tot = 0;
    while (x) a[tot++] = x % k, x /= k;
  }
  int &operator[](int x) { return a[x]; }
  const int &operator[](int x) const { return a[x]; }
};
modvec operator+(const modvec &a, const modvec &b) {
  modvec c;
  for (int i = 0; i < 31; i++) c[i] = (a[i] + b[i]) % k;
  return c;
}
modvec operator-(const modvec &a, const modvec &b) {
  modvec c;
  for (int i = 0; i < 31; i++) c[i] = (a[i] - b[i] + k) % k;
  return c;
}
modvec operator*(const modvec &a, int b) {
  modvec c;
  for (int i = 0; i < 31; i++) c[i] = 1ll * a[i] * b % k;
  return c;
}
void exgcd(int a, int b, int &x, int &y) {
  if (!b) {
    x = 1, y = 0;
    return;
  }
  exgcd(b, a % b, x, y);
  int t = x;
  x = y, y = t - a / b * y;
}
modvec b[31];
int toint(modvec x) {
  int ans = 0;
  for (int i = 30; i >= 0; i--) {
    ans = ans * k + x[i];
  }
  return ans;
}
void insert(modvec x) {
  for (int i = 30; i >= 0; i--) {
    if (x[i]) {
      if (!b[i][i]) {
        int cx, cy;
        exgcd(x[i], k, cx, cy);
        cx = (cx % k + k) % k;
        x = x * cx;
        b[i] = x;
        x = x * (k / __gcd(x[i], k));
      } else {
        while (x[i]) {
          b[i] = b[i] - x * (b[i][i] / x[i]);
          swap(b[i], x);
        }
      }
    }
  }
}
modvec query(modvec x) {
  for (int i = 30; i >= 0; i--) {
    if (b[i][i]) {
      x = x - b[i] * (x[i] / b[i][i]);
    }
  }
  return x;
}
#define N 210000
int q, m, val[N], tot = 1;
int main() {
  cin.tie(0)->sync_with_stdio(0);
  cin >> q >> k >> m;
  for (int i = 1; i <= q; i++) {
    int opt;
    cin >> opt;
    if (opt == 1) {
      int x, v;
      cin >> x >> v, tot++;
      val[tot] = val[x] ^ v;
      insert(modvec(v) * 2);
    } else if (opt == 2) {
      int x, y, v;
      cin >> x >> y >> v;
      insert(modvec(val[x] ^ val[y] ^ v));
    } else {
      int x, y;
      cin >> x >> y;
      cout << toint(query(modvec(val[x] ^ val[y]))) << '\n';
    }
  }
  return 0;
}