#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> weight;
	vector<int> parent_or_size;
	vector<mint> ans;
	unionFind(int sz) :n(sz), parent_or_size(sz, -1), ans(n), weight(n, 1 << 30) {}

	int leader(int v) {
		while (parent_or_size[v] >= 0) v = parent_or_size[v];
		return v;
	}
	bool same(int u, int v) {
		return leader(u) == leader(v);
	}
	void merge(int u, int v, int w) {
		u = leader(u);
		v = leader(v);
		if (u == v)return;
		if (-parent_or_size[u] < -parent_or_size[v]) swap(u, v);
		ans[u] += ans[v] + mint(w) * -parent_or_size[u] * -parent_or_size[v];
		parent_or_size[u] += parent_or_size[v];
		parent_or_size[v] = u;
		weight[v] = w;
	}
	int dist(int u, int v) {
		if (!same(u, v))return -1;
		int ans = 0;
		while (u != v) {
			if (weight[u] < weight[v])swap(u, v);
			ans = weight[v];
			v = parent_or_size[v];
		}
		return ans;
	}
};
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 u; cin >> u;
			cout << uf.ans[uf.leader(u)].val() << endl;
		}
		else {
			int u; cin >> u;
			x = (x + u) % n;
		}
	}
	return 0;
}