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

constexpr int mod = 998244353;

struct UnionFind {
    vector<int> par;
    vector<int> size;
    vector<int> sum;
    vector<vector<int>>cnt;
    vector<vector<int>>cld;
    UnionFind(int n) {
        par.resize(n);
        sum.resize(n);
        size.resize(n,1);
        cld.resize(n);
        cnt.resize(n);
        for(int i = 0; i < n; i++) {
            par[i] = i;
            cld[i].push_back(i);
            cnt[i].resize(30);
        }
    }
    int find(int x) {
        if(par[x] == x) {
            return x;
        }
        return par[x] = find(par[x]);
    }
    bool same(int x, int y) {
        return find(x) == find(y);
    }
    int consize(int x) {
        return size[find(x)];
    }
    bool unite(int x,int y,int w) {
        int s = sum[x]^sum[y];
        x = find(x);
        y = find(y);
        if(x == y) {
            return false;
        }
        if(size[x] > size[y]) {
            swap(x,y);
        }
        par[x] = y;
        size[y] += size[x];
        for(auto i:cld[x]) {
            sum[i] ^= s^w;
            for(int j = 0; j < 30; j++) {
                if(1 & (sum[i] >> j)) {
                    cnt[y][j]++;
                }
            }
            cld[y].push_back(i);
        }
        return true;
    }
};

int main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    int N,X,Q;
    cin >> N >> X >> Q;
    UnionFind uf(N);
    while(Q--) {
        int f;
        cin >> f;
        if(f == 1) {
            int v,w;
            cin >> v >> w;
            uf.unite(v,X,w);
        }
        if(f == 2) {
            int u,v;
            cin >> u >> v;
            if(uf.same(u,v)) {
                int s = uf.sum[u]^uf.sum[v];
                cout << s << "\n";
                X = (X+s)%N;
            }
            else {
                cout << -1 << "\n";
            }
        }
        if(f == 3) {
            int v;
            cin >> v;
            int s = uf.consize(v);
            int ans = 0;
            for(int i = 0; i < 30; i++) {
                int c = uf.cnt[uf.find(v)][i];
                ans += (1ll << i)*(s-c)*c%mod;
                if(ans >= mod) ans -= mod;
            }
            cout << ans << "\n";
        }
        if(f == 4) {
            int v;
            cin >> v;
            X = (X+v)%N;
        }
    }
}