1 #include<bits/stdc++.h>
 2 using namespace std;
 3 #define R register int
 4 #define rep(i,a,b) for(R i=a;i<=b;i++)
 5 #define Rep(i,a,b) for(R i=a;i>=b;i--)
 6 #define ms(i,a)    memset(a,i,sizeof(a))
 7 #define gc()       getchar()
 8 #define LL         long long
 9 #define I          inline int
10 #define pa         fa[x]
11 #define lc         ch[x][0]
12 #define rc         ch[x][1]
13 template<class T>void read(T &x){
14     x=0; char c=0;
15     while (!isdigit(c)) c=gc();
16     while (isdigit(c)) x=x*10+(c^48),c=gc();
17 }
18 int const N=100000+3;
19 int const M=200000+3;
20 int n,m,top,st[N],ans,tp,sk[N];
21 int fa[N],ch[N][2],r[N],sum[N],sz[N];
22 I get(int x){return ch[pa][1]==x;}
23 I isr(int x){return ch[pa][0]!=x && ch[pa][1]!=x; }
24 I update(int x){sum[x]=sum[lc]+sum[rc]+sz[x]+1;}
25 I con(int x,int y,int z){fa[x]=y;ch[y][z]=x;}
26 I rotate(int x){
27     int f=fa[x],g=fa[f],c=get(x),cc=get(f);
28     if (!isr(f))  ch[g][cc]=x; fa[x]=g;
29     con(ch[x][c^1],f,c);con(f,x,c^1);
30     update(f); update(x);
31 }
32 I pushd(int x){
33     if(!r[x]) return 0;
34     swap(ch[lc][0],ch[lc][1]);
35     swap(ch[rc][0],ch[rc][1]);
36     r[lc]^=1; r[rc]^=1; r[x]=0;
37 }
38 I splay(int x){
39     top=0; int k=x; while (!isr(k)) st[++top]=k,k=fa[k]; st[++top]=k;
40     while (top) pushd(st[top--]);
41     for(;!isr(x);rotate(x)) if(!isr(pa))  rotate(get(x)==get(pa)? pa :x);
42 }
43 I access(int x){
44     for(int y=0; x;  y=x,x=pa){
45         splay(x);
46         sz[x]+=sum[rc]-sum[y];
47         rc=y,update(x);
48     }
49 }
50 I make(int x){
51     access(x); splay(x); r[x]^=1; swap(lc,rc);
52 }
53 I find(int x){
54     access(x); splay(x);
55     while (lc) x=lc;
56     return x;
57 }
58 I split(int x,int y){
59     make(x); access(y);  splay(y);
60 }
61 I link(int x,int y){
62     make(x);   fa[x]=y; sz[y]+=sum[x]; update(y);
63 }
64 void dfs(int x,int s){
65     if(tp>s) return ;
66     pushd(x);
67     if(lc) dfs(lc,s);
68     sk[++tp]=x;
69     if(rc) dfs(rc,s);
70 }
71 int main(){
72     read(n); read(m);
73     rep(i,1,n) ans^=i,sum[i]=1;
74     while (m--){
75         char s[10];
76         scanf("%s",s);
77         if(s[0]=='X') printf("%d\n",ans);
78         if(s[0]=='A'){
79             int x,y; read(x); read(y);
80             int tx=find(x),ty=find(y);
81             ans^=tx; ans^=ty;
82             splay(tx); splay(ty);
83             if(sum[tx]>sum[ty] || sum[tx]==sum[ty] && x<y)  swap(x,y),swap(tx,ty);
84             int s=sum[tx], ts=sum[tx]+sum[ty];
85             link(x,y);access(x); splay(ty);
86             tp=0,dfs(ty,s); int r=ty;
87             rep(i,1,tp){
88                 splay(sk[i]); int t=sz[sk[i]]+1+sum[ch[sk[i]][1]];
89                 if(2*t>ts || 2*t==ts && r>=sk[i]) r=sk[i];
90             }
91             make(r); ans^=r;
92         }
93         if(s[0]=='Q') {
94             int x; read(x);
95             printf("%d\n",find(x));
96         }
97     }
98 }