#include<bits/stdc++.h>
// #include<atcoder/all>
#include<boost/multiprecision/cpp_int.hpp>

using namespace std;
// using namespace atcoder;
using bint = boost::multiprecision::cpp_int;
using ll = long long;
using ull = unsigned long long;
using P = pair<ll,ll>;
using vi = vector<ll>;
using vvi = vector<vi>;
using vvvi = vector<vvi>;
#define rep(i,n) for(ll i = 0;i < (ll)n;i++)
#define ALL(x) (x).begin(),(x).end()
#define sz(c) ((ll)(c).size())
#define LB(A,x) (int)(lower_bound(A.begin(),A.end(),x)-A.begin())
#define UB(A,x) (int)(upper_bound(A.begin(),A.end(),x)-A.begin())
// #define MOD 1000000007
#define MOD 998244353
template<typename T>using min_priority_queue=priority_queue<T,vector<T>,greater<T>>;
template<typename T>ostream&operator<<(ostream&os,vector<T>&v){for(int i = 0;i < v.size();i++)os<<v[i]<<(i+1!=v.size()?" ":"");return os;}
template<typename T>istream&operator>>(istream&is,vector<T>&v){for(T&in:v)is>>in;return is;}
template<typename T1,typename T2>ostream&operator<<(ostream&os,pair<T1,T2>&p){os<<p.first<<" "<<p.second;return os;}
template<typename T1,typename T2>istream&operator>>(istream&is,pair<T1,T2>&p){is>>p.first>>p.second;return is;}


class UnionFind{
  public:
  vector<int> par;
  UnionFind(long long size) : par(size,-1){}

  bool unite(int x,int y){
    x = root(x),y = root(y);
    if(x == y)return false;
    if(par[y] < par[x])swap(x,y);
    par[x] += par[y];
    par[y] = x;
    return true;
  }

  bool find(int x,int y){
    return root(x) == root(y);
  }

  int root(int x){
    return par[x] < 0 ? x : par[x] = root(par[x]);
  }

  int size(int x){
    return -par[root(x)];
  }
};

int LG_N = 20;

int main(){
  
  ios_base::sync_with_stdio(0), cin.tie(0);
  ll n,X,Q;
  cin >> n >> X >> Q;
  vi d(n);
  vector<vector<int>> nxt(n,vector<int>(LG_N));
  rep(i,n)rep(j,LG_N)nxt[i][j] = i;
  UnionFind uf(n);
  vector<vector<P>> v(n);
  vector<vector<int>> cand(n,vector<int>(2));
  rep(i,n)rep(j,2)cand[i][j] = i;
  auto dfs = [&](auto &dfs,int ov,int pre)->void{
    nxt[ov][0] = pre;
    rep(i,LG_N-1)nxt[ov][i+1] = nxt[nxt[ov][i]][i];
    for(auto [nv,we] : v[ov]){
      if(nv == pre)continue;
      d[nv] = d[ov] + we;
      dfs(dfs,nv,ov);
    }
  };
  auto LCA = [&](ll a,ll b)->ll{
    if(d[a] < d[b])swap(a,b);
    for(int i = LG_N-1;i >= 0;i--)if(d[nxt[a][i]] >= d[b])a = nxt[a][i];
    if(a == b)return a;
    for(int i = LG_N-1;i >= 0;i--)if(nxt[a][i] != nxt[b][i])a = nxt[a][i],b = nxt[b][i];
    return nxt[a][0];
  };
  auto dist = [&](ll a,ll b)->ll{
    if(!uf.find(a,b))return -1;
    return d[a] + d[b]-2*d[LCA(a,b)];
  };
  auto ch = [&](ll a,ll b)->void{
    ll mx = dist(cand[a][0],cand[a][1]);
    P k = {cand[a][0],cand[a][1]};
    if(dist(cand[b][0],cand[b][1]) > mx){
      k = {cand[b][0],cand[b][1]};
      mx = dist(cand[b][0],cand[b][1]);
    }
    rep(i,2)rep(j,2){
      if(dist(cand[a][i],cand[b][j]) > mx){
        mx = dist(cand[a][i],cand[b][j]);
        k = {cand[a][i],cand[b][j]};
      }
    }
    cand[b][0] = k.first;
    cand[b][1] = k.second;
    cand[a][0] = k.first;
    cand[a][1] = k.second;
  };
  while(Q--){
    ll t;cin >> t;
    if(t == 1){
      ll a,w;cin >> a >> w;
      ll b = X;
      if(uf.size(b) > uf.size(a))swap(b,a);
      d[b] = d[a] + w;
      dfs(dfs,b,a);
      v[a].emplace_back(b,w);
      v[b].emplace_back(a,w);
      a = uf.root(a),b = uf.root(b);
      uf.unite(b,a);
      ch(a,b);
    }else if(t == 2){
      ll a,b;cin >> a >> b;
      ll res = dist(a,b);
      cout << res << "\n";
      if(res != -1)X = (X + res)%n;
    }else if(t == 3){
      ll a;cin >> a;
      a = uf.root(a);
      cout << dist(cand[a][0],cand[a][1]) << "\n";
    }else{
      ll val;cin >> val;
      X = (X + val)%n;
    }
  }
  

  return 0;
}