#include<bits/stdc++.h>
using namespace std;
//#pragma GCC optimize("Ofast")
#define rep(i,n) for(ll i=0;i<n;i++)
#define repl(i,l,r) for(ll i=(l);i<(r);i++)
#define per(i,n) for(ll i=(n)-1;i>=0;i--)
#define perl(i,r,l) for(ll i=r-1;i>=l;i--)
#define fi first
#define se second
#define pb push_back
#define ins insert
#define pqueue(x) priority_queue<x,vector<x>,greater<x>>
#define all(x) (x).begin(),(x).end()
#define CST(x) cout<<fixed<<setprecision(x)
#define rev(x) reverse(x);
using ll=long long;
using vl=vector<ll>;
using vvl=vector<vector<ll>>;
using pl=pair<ll,ll>;
using vpl=vector<pl>;
using vvpl=vector<vpl>;
const ll MOD=1000000007;
const ll MOD9=998244353;
const int inf=1e9+10;
const ll INF=4e18;
const ll dy[8]={1,0,-1,0,1,1,-1,-1};
const ll dx[8]={0,1,0,-1,1,-1,1,-1};
template <typename T> inline bool chmax(T &a, T b) {
  return ((a < b) ? (a = b, true) : (false));
}
template <typename T> inline bool chmin(T &a, T b) {
  return ((a > b) ? (a = b, true) : (false));
}

struct UnionFind {
    vector<int> par;
    vector<int> edge;
    vector<vl> fsum;
    vector<map<ll,ll>> sts;
    
    UnionFind(int n) : par(n, -1),edge(n, 0) {
      fsum.resize(n);rep(i,n)fsum[i].resize(32);
      sts.resize(n);rep(i,n)sts[i][i]=0;
    }

    int root(int x) {
        if (par[x] < 0) return x;
        else return par[x] = root(par[x]);
    }
    
    bool same(int x, int y) {
        return root(x) == root(y);
    }
    
    bool merge(int x, int y,ll w) {
        int u=x,v=y;//端点
        x = root(x); y = root(y);
        if (x == y) {
            edge[x]++;
            return false;
        }
        if (par[x] > par[y]) {
          swap(x, y);swap(u,v);
        }
        par[x] += par[y];
        par[y] = x;
        edge[x] += edge[y]+1;
        ll cod=sts[x][u]^sts[y][v]^w;
        if(sts[x].size()<sts[y].size()){
          swap(sts[x],sts[y]);
          swap(fsum[x],fsum[y]);
        }
        for(auto p:sts[y]){
          ll nf=p.second^cod;
          rep(i,32){
            if(nf>>i&1)fsum[x][i]++;
          }
          sts[x][p.first]=p.second^cod;
        }
        return true;
    }
    
    int size(int x) {
        return -par[root(x)];
    }

    ll dist(int x,int y) {
      ll u=x,v=y;
      x=root(x),y=root(y);
      if(x!=y)return -1;
      else return sts[x][u]^sts[x][v];
    }

  ll query(int x) {
    x=root(x);
    ll ans=0;
    ll f=1;
    rep(i,32){
      ll z=fsum[x][i]*((ll)sts[x].size()-fsum[x][i]);z%=MOD9;
      ans+=f*z;ans%=MOD9;
      f*=2;
    }
    return ans;
  }
};
int main(){
  ll n,x,q;cin >> n >> x >> q;
  UnionFind uf(n);
  while(q--){
    ll t;cin >> t;
    if(t==1){
      ll v,w;cin >> v >> w;
      uf.merge(x,v,w);
    }
    else if(t==2){
      ll u,v;cin >> u >> v;
      ll f=uf.dist(u,v);
      cout << uf.dist(u,v) << endl;
      if(f!=-1)x+=f;x%=n;
    }
    else if(t==3){
      ll v;cin >> v;
      cout << uf.query(v) << endl;
    }
    else{
      ll v;cin >> v;x+=v;x%=n;
    }
    /*rep(i,n){
      for(auto p:uf.sts[i])cout << p.first <<" " << p.second <<" ";cout << endl;
    }*/
  }
}