#include <bits/stdc++.h>
#include <atcoder/all>
using namespace std;
using namespace atcoder;
//using mint = modint1000000007;
//const int mod = 1000000007;
using mint = modint998244353;
const int mod = 998244353;
//const int INF = 1e9;
//const long long LINF = 1e18;
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rep2(i,l,r)for(int i=(l);i<(r);++i)
#define rrep(i, n) for (int i = (n-1); i >= 0; --i)
#define rrep2(i,l,r)for(int i=(r-1);i>=(l);--i)
#define all(x) (x).begin(),(x).end()
#define allR(x) (x).rbegin(),(x).rend()
#define endl "\n"
#define P pair<int,int>
template<typename A, typename B> inline bool chmax(A & a, const B & b) { if (a < b) { a = b; return true; } return false; }
template<typename A, typename B> inline bool chmin(A & a, const B & b) { if (a > b) { a = b; return true; } return false; }
struct unionfind {
	int n;
	vector<int> par_or_size;
	// leaderからのxor距離
	vector<int>weight;
	// leaderの時にのみ機能する
	// 同じグループに属するすべての頂点のxor距離をbit単位でみて
	// bitが立ってない/立っているの個数
	vector<array<array<mint, 2>, 30>> cnt;
	// ans
	vector<mint>ans;
	unionfind(int n_) :n(n_), cnt(n), weight(n), par_or_size(n, -1), ans(n) {
		rep(i, n)rep(j, 30)cnt[i][j][0]++;
	}
	int leader(int v) {
		if (par_or_size[v] < 0)return v;
		int root = leader(par_or_size[v]);
		weight[v] ^= weight[par_or_size[v]];
		return par_or_size[v] = root;
	}
	void merge(int u, int v, int w) {
		int ul = leader(u);
		int vl = leader(v);
		w ^= weight[u] ^ weight[v];
		if (-par_or_size[ul] < -par_or_size[vl])swap(ul, vl);
		par_or_size[ul] += par_or_size[vl];
		par_or_size[vl] = ul;
		weight[vl] = w;
		ans[ul] = 0;
		rep(i, 30) {
			rep(j, 2) {
				cnt[ul][i][j ^ ((w >> i) & 1)] += cnt[vl][i][j];
			}
			ans[ul] += cnt[ul][i][0] * cnt[ul][i][1] * (1 << i);
		}
	}
	int dist(int u, int v) {
		if (leader(u) != leader(v))return -1;
		return weight[u] ^ weight[v];
	}
};
int main() {
	ios::sync_with_stdio(false);
	cin.tie(nullptr);
	int n, x, q; cin >> n >> x >> q;
	unionfind uf(n);
	while (q--) {
		int t; cin >> t;
		if (1 == t) {
			int v, w; cin >> v >> w;
			uf.merge(v, x, w);
		}
		else if (2 == t) {
			int u, v; cin >> u >> v;
			int d = uf.dist(u, v);
			cout << d << endl;
			if (-1 != d) {
				x = (x + d) % n;
			}
		}
		else if (3 == t) {
			int v; cin >> v;
			cout << uf.ans[uf.leader(v)].val() << endl;
		}
		else {
			int v; cin >> v;
			x = (x + v) % n;
		}
	}
	return 0;
}