#include <vector>
#include <algorithm>

namespace nachia {

struct Dsu{
private:
    int N;
    std::vector<int> P;
    std::vector<int> H;
public:
    Dsu() : N(0) {}
    Dsu(int n) : N(n), P(n, -1), H(n) {
        for(int i=0; i<n; i++) H[i] = i;
    }
    int leader(int u){
        if(P[u] < 0) return u;
        int v = P[u];
        while(P[v] >= 0){ P[u] = P[v]; u = v; v = P[v]; }
        return P[u];
    }
    int append(){
        int n = P.size();
        P.push_back(-1);
        H.push_back(n);
        return n;
    }
    int label(int u){ return H[leader(u)]; }
    int operator[](int u){ return H[leader(u)]; }
    void merge(int u, int v, int newLabel){
        if(newLabel < 0) newLabel = u;
        u = leader(u);
        v = leader(v);
        if(u == v){ H[u] = newLabel; return; }
        N--;
        if(-P[u] < -P[v]) std::swap(u, v);
        P[u] += P[v];
        H[P[v] = u] = newLabel;
    }
    int merge(int u, int v){ merge(u, v, u); return u; }
    int count(){ return N; }
    int size(int u){ return -P[leader(u)]; }
    bool same(int u, int v){ return leader(u) == leader(v); }
};

} // namespace nachia

#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <set>
#include <atcoder/modint>
using namespace std;
using i32 = int;
using u32 = unsigned int;
using i64 = long long;
using u64 = unsigned long long;
#define rep(i,n) for(int i=0; i<(int)(n); i++)
const i64 INF = 1001001001001001001;

using Modint = atcoder::static_modint<998244353>;

int main(){
    long long N, X, Q; cin >> N >> X >> Q;
    auto dsu0 = vector<nachia::Dsu>(30, nachia::Dsu(N*2));
    auto dsu = nachia::Dsu(N);
    vector<vector<pair<int,int>>> sum(N);
    rep(i,N) sum[i].assign(30, {1,0});
    rep(i,Q){
        int t; cin >> t;
        if(t == 1){
            int v, w; cin >> v >> w;
            int dv = dsu[v];
            int dX = dsu[X];
            rep(d,30){
                int val = (w >> d) & 1;
                if(!dsu0[d].same(v, dv)) val ^= 1;
                if(!dsu0[d].same(X, dX)) val ^= 1;
                if(val){
                    dsu0[d].merge(dv, dX + N);
                    dsu0[d].merge(dv + N, dX);
                    sum[dv][d].second += sum[dX][d].first;
                    sum[dv][d].first += sum[dX][d].second;
                }
                else{
                    dsu0[d].merge(dv, dX);
                    dsu0[d].merge(dv + N, dX + N);
                    sum[dv][d].first += sum[dX][d].first;
                    sum[dv][d].second += sum[dX][d].second;
                }
            }
            dsu.merge(v, X, dv);
        }
        if(t == 2){
            int u, v; cin >> u >> v;
            if(!dsu.same(u, v)){
                cout << "-1\n";
            }
            else{
                int ans = 0;
                rep(d,30) if(!dsu0[d].same(u, v)) ans += 1 << d;
                X = (X + ans) % N;
                cout << ans << '\n';
            }
        }
        if(t == 3){
            int v; cin >> v;
            v = dsu[v];
            long long ans = 0;
            rep(d,30){
                long long x = (long long)sum[v][d].first * sum[v][d].second % 998244353;
                ans += (x << d);
                ans %= 998244353;
            }
            cout << ans << '\n';
        }
        if(t == 4){
            long long v; cin >> v;
            X = (X + v) % N;
        }
    }
    return 0;
}



struct ios_do_not_sync{
    ios_do_not_sync(){
        ios::sync_with_stdio(false);
        cin.tie(nullptr);
    }
} ios_do_not_sync_instance;