#include <bits/stdc++.h>
#include <bits/extc++.h>
using namespace __gnu_pbds;
using namespace std;
// #pragma GCC optimize("Ofast")
// #pragma GCC optimize ("unroll-loops")
// #pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#define ff first
#define sc second
#define pb push_back
#define ll long long
#define pll pair<ll, ll>
#define pii pair<int, int>
#define ull unsigned long long
#define all(x) (x).begin(),(x).end()
#define rall(x) (x).rbegin(),(x).rend()
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
mt19937_64 rngl(chrono::steady_clock::now().time_since_epoch().count());
// #define int long long
// #define int unsigned long long
// #define ordered_set(T) tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>
// #define ordered_multiset(T) tree<T, null_type, less_equal<T>, rb_tree_tag, tree_order_statistics_node_update>
// const ll mod = 1e9 + 7;
// const ll mod = 998244353;
const ll inf = 1e9;
const ll biginf = 1e18;
const int maxN = 1e5 + 15;
int n, q, par[maxN], sz[maxN], pr[maxN];
void make_set() {
for (int i = 1; i <= n; i++) {
par[i] = i; sz[i] = 1;
}
}
pii find_set(int v) {
if (par[v] == v)
return {v, 0};
pii cur = find_set(par[v]);
par[v] = cur.ff; pr[v] ^= cur.sc;
return {par[v], pr[v]};
}
void union_set(int a, int b, int w) {
pii x = find_set(a);
pii y = find_set(b);
if (x.ff == y.ff) return;
if (sz[x.ff] < sz[y.ff]) swap(x, y);
par[y.ff] = x.ff; sz[x.ff] += sz[y.ff];
pr[y.ff] = (x.sc ^ y.sc ^ w);
}
void solve() {
cin >> n >> q;
make_set();
while (q--) {
char v; cin >> v;
if (v == 'Q') {
int a, b; cin >> a >> b;
pii x = find_set(a), y = find_set(b);
if (x.ff != y.ff) { cout << "?\n"; continue; }
if (x.sc == y.sc) { cout << "R\n"; continue; }
cout << "A\n";
} else if (v == 'A') {
int a, b; cin >> a >> b; union_set(a, b, 1);
} else {
int a, b; cin >> a >> b; union_set(a, b, 0);
}
}
}
int32_t main() {
// #ifndef ONLINE_JUDGE
// freopen("input.txt", "r", stdin);
// freopen("output.txt", "w", stdout);
// #endif
ios_base::sync_with_stdio(false);
cin.tie(nullptr); cout.tie(nullptr);
int t = 1;
// cin >> t;
while (t--) {
solve();
cout << '\n';
}
return 0;
}
