#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define int long long
#define FOR(i, a, b) for (int i = (a); i <= (b); i++)
#define FORD(i, a, b) for (int i = (b); i >= (a); i --)
#define REP(i, n) for (int i = 0; i < (n); ++i)
#define REPD(i, n) for (int i = (n) - 1; i >= 0; --i)
#define MASK(i) (1LL << (i))
#define BIT(x, i) (((x) >> (i)) & 1)
constexpr ll LINF = (1ll << 60);
constexpr int INF = (1ll << 30);
constexpr int Mod = 1e9 + 7;
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
/*
Phu Trong from Nguyen Tat Thanh High School for gifted student
*/
template <class X, class Y>
bool minimize(X &x, const Y &y){
X eps = 1e-9;
if (x > y + eps) {x = y; return 1;}
return 0;
}
template <class X, class Y>
bool maximize(X &x, const Y &y){
X eps = 1e-9;
if (x + eps < y) {x = y; return 1;}
return 0;
}
#define MAX 100005
int pa[MAX][2], sz[MAX][2];
int find(int u, int c){
return (u == pa[u][c] ? u : pa[u][c] = find(pa[u][c], c));
}
bool unite(int u, int v, int c){
u = find(u, c), v = find(v, c);
if (u == v) return true;
if (sz[u][c] < sz[v][c]) swap(u, v);
sz[u][c] += sz[v][c];
pa[v][c] = u;
return true;
}
int numNode, numQuery;
void process(void){
cin >> numNode >> numQuery;
for (int i = 1; i <= numNode; ++i) pa[i][0] = pa[i][1] = i, sz[i][0] = sz[i][1] = 1;
for (int i = 1; i <= numQuery; ++i){
char c; int u, v;
cin >> c >> u >> v;
if (c == 'R'){
unite(u, v, 0);
continue;
}
if (c == 'A'){
unite(u, v, 1);
continue;
}
if (c == 'Q'){
u = find(u, 1), v = find(v, 1);
if(u == v) {
cout << "A\n"; continue;
}
u = find(u, 0), v = find(v, 0);
if(u == v){
cout << "R\n"; continue;
}
cout << "?\n";
}
}
}
signed main(){
#define name "Whisper"
cin.tie(nullptr) -> sync_with_stdio(false);
//freopen(name".inp", "r", stdin);
//freopen(name".out", "w", stdout);
process();
}
