#include<bits/stdc++.h>
#define int long long
#define rep(i,a,b) for(int i=(a);i<=(b);i++)
#define per(i,a,b) for(int i=(a);i>=(b);i--)
#define fi first
#define se second
#define eb emplace_back
#define popc __builtin_popcount
using namespace std;
typedef long long ll;
typedef pair<int,int> pii;
typedef vector<int> vi;
typedef vector<pii> vp;
typedef unsigned long long ull;
typedef long double ld;

int read() {
  int x=0,w=1; char c=getchar(); 
  while(!isdigit(c)) {if(c=='-') w=-1; c=getchar();}
  while(isdigit(c)) {x=x*10+(c-'0'); c=getchar();}
  return x*w;
}

const int N=2e5+9;
int n,m,x,f[N][22],d[N],s[N],l[N],r[N],len[N],sz[N],rt[N];
int tu[2],tv[2];
vp e[N];

int lca(int u,int v) {
  if(d[u]<d[v]) swap(u,v);
  per(h,18,0) if(d[f[u][h]]>=d[v]) u=f[u][h];
  per(h,18,0) if(f[u][h]!=f[v][h]) u=f[u][h], v=f[v][h];
  return u==v?u:f[u][0];
}
int dis(int u,int v) {
  int l=lca(u,v);
  return s[u]+s[v]-s[l]*2;
}
void dfs(int u,int fa,int r) {
  f[u][0]=fa, d[u]=d[fa]+1, sz[r]++, rt[u]=r;
  rep(h,1,18) f[u][h]=f[f[u][h-1]][h-1];
  for(auto [v,w]:e[u]) if(v!=fa)
    s[v]=s[u]+w, dfs(v,u,r);
}
void merge(int u,int v,int w) {
  if(sz[rt[u]]<sz[rt[v]]) swap(u,v); int yv=rt[v];
  s[v]=s[u]+w, dfs(v,u,rt[u]), e[u].eb(v,w), e[v].eb(u,w);
  u=rt[u], v=yv;
  tu[0]=l[u], tu[1]=r[u], tv[0]=l[v], tv[1]=r[v];
  if(len[v]>len[u]) len[u]=len[v], l[u]=l[v], r[u]=r[v];
  rep(i,0,1) rep(j,0,1) {
    int dd=dis(tu[i],tv[j]);
    if(dd>len[u]) len[u]=dd, l[u]=tu[i], r[u]=tv[j];
  }
}

signed main() {
  n=read(), x=read(), m=read();
  rep(i,1,n) rt[i]=i, d[i]=1, sz[i]=1, l[i]=r[i]=i;
  rep(i,1,m) {
    int opt=read();
    if(opt==1) {
      int v=read()+1, w=read(), u=x+1;
      merge(u,v,w);
    } else if(opt==2) {
      int u=read()+1, v=read()+1, res=0;
      if(rt[u]!=rt[v]) puts("-1");
      else printf("%lld\n",res=dis(u,v)), x=(x+res)%n;
    } else if(opt==3) {
      int v=read()+1, u=rt[v];
      printf("%lld\n",len[u]);
    } else if(opt==4) {
      int val=read(); x=(x+val)%n;
    }
  }
  return 0;
}