Problem: Oscolcovo city has a campus consisting of n student dormitories, n universities and n military offices. Initially, the i-th dormitory belongs to the i-th university and is assigned to the i-th military office.

Life goes on and the campus is continuously going through some changes. The changes can be of four types:

  1. University aj merges with university bj. After that all the dormitories that belonged to university bj are assigned to to university aj, and university bj disappears. 
  2. Military office cj merges with military office dj. After that all the dormitories that were assigned to military office dj, are assigned to military office cj, and military office dj disappears. 
  3. Students of university xj move in dormitories. Lets kxj is the number of dormitories that belong to this university at the time when the students move in. Then the number of students in each dormitory of university xj increases by kxj (note that the more dormitories belong to the university, the more students move in each dormitory of the university). 
  4. Military office number yj conducts raids on all the dormitories assigned to it and takes all students from there. 



Thus, at each moment of time each dormitory is assigned to exactly one university and one military office. Initially, all the dormitory are empty.

Your task is to process the changes that take place in the campus and answer the queries, how many people currently live in dormitory qj.

Input

The first line contains two integers, n and m (1 ≤ n, m ≤ 5·105) — the number of dormitories and the number of queries, respectively.

Next m lines contain the queries, each of them is given in one of the following formats: 

  * «U aj bj» — merging universities; 
  * «M cj dj» — merging military offices; 
  * «A xj» — students of university xj moving in the dormitories; 
  * «Z yj» — a raid in military office yj; 
  * «Q qj» — a query asking the number of people in dormitory qj. 

All the numbers in the queries are positive integers and do not exceed n. It is guaranteed that at the moment of the query the universities and military offices, that are present in the query, exist.

Output

In the i-th line print the answer to the i-th query asking the number of people in the dormitory.

Examples

Input

2 7
A 1
Q 1
U 1 2
A 1
Z 1
Q 1
Q 2


Output

1
0
2


Input

5 12
U 1 2
M 4 5
A 1
Q 1
A 3
A 4
Q 3
Q 4
Z 4
Q 4
A 5
Q 5


Output

2
1
1
0
1

Note

Consider the first sample test: 

  * In the first query university 1 owns only dormitory 1, so after the query dormitory 1 will have 1 student. 
  * After the third query university 1 owns dormitories 1 and 2. 
  * The fourth query increases by 2 the number of students living in dormitories 1 and 2 that belong to university number 1. After that 3 students live in the first dormitory and 2 students live in the second dormitory. 
  * At the fifth query the number of students living in dormitory 1, assigned to the military office 1, becomes zero. 

Solution (in CPP):

Solution:
#include <bits/stdc++.h>
using namespace std;
const int N = 5e5 + 10;
int n, m;
struct bian {
  int from, to;
};
struct tree {
  bian eg[N << 2];
  int num, front[N << 1];
  int zong;
  int fa[N << 1], siz[N << 1];
  void add(int x, int y) {
    eg[++num].to = y;
    eg[num].from = front[x];
    front[x] = num;
  }
  void init() {
    zong = n;
    for (int i = 1; i <= zong; ++i) fa[i] = i, siz[i] = 1;
  }
  int find(int x) { return x == fa[x] ? x : fa[x] = find(fa[x]); }
  int tot, now;
  int son[N << 4][2];
  long long tag[N << 4];
  int root[N];
  void merge(int x, int y) {
    int d1 = find(x), d2 = find(y);
    fa[++zong] = zong;
    add(zong, d1);
    add(zong, d2);
    siz[zong] = siz[find(x)] + siz[find(y)];
    fa[d1] = zong;
    fa[d2] = zong;
  }
  int ll[N << 1], rr[N << 1], ids[N], p;
  void dfs(int o) {
    if (o <= n) {
      ids[o] = ++p;
      ll[o] = rr[o] = ids[o];
      return;
    }
    ll[o] = 1e9;
    for (int i = front[o]; i; i = eg[i].from) {
      int to = eg[i].to;
      dfs(to);
      ll[o] = min(ll[o], ll[to]);
      rr[o] = max(rr[o], rr[to]);
    }
  }
  void opt1(int be, int &o, int l, int r, int L, int R, int w) {
    if (o == 0) o = ++tot;
    tag[o] = tag[be];
    if (L <= l && r <= R) {
      tag[o] += w;
      son[o][0] = son[be][0];
      son[o][1] = son[be][1];
      return;
    }
    int mid = (l + r) >> 1;
    if (mid >= L)
      opt1(son[be][0], son[o][0], l, mid, L, R, w);
    else
      son[o][0] = son[be][0];
    if (mid < R)
      opt1(son[be][1], son[o][1], mid + 1, r, L, R, w);
    else
      son[o][1] = son[be][1];
  }
  long long opt2(int o, int l, int r, int i, long long now) {
    if (o == 0) return now;
    if (l == r) return now + tag[o];
    int mid = (l + r) >> 1;
    if (mid >= i)
      return opt2(son[o][0], l, mid, i, now + tag[o]);
    else
      return opt2(son[o][1], mid + 1, r, i, now + tag[o]);
  }
} T1;
struct tree_ {
  bian eg[N << 2];
  int num, front[N << 1];
  int zong;
  int fa[N << 1];
  void add(int x, int y) {
    eg[++num].to = y;
    eg[num].from = front[x];
    front[x] = num;
  }
  void init() {
    zong = n;
    for (int i = 1; i <= zong; ++i) fa[i] = i;
  }
  int find(int x) { return x == fa[x] ? x : fa[x] = find(fa[x]); }
  void merge(int x, int y) {
    int d1 = find(x), d2 = find(y);
    fa[++zong] = zong;
    add(zong, d1);
    add(zong, d2);
    fa[d1] = zong;
    fa[d2] = zong;
  }
  int ll[N << 1], rr[N << 1], ids[N], p;
  void dfs(int o) {
    if (o <= n) {
      ids[o] = ++p;
      ll[o] = rr[o] = ids[o];
      return;
    }
    ll[o] = 1e9;
    for (int i = front[o]; i; i = eg[i].from) {
      int to = eg[i].to;
      dfs(to);
      ll[o] = min(ll[o], ll[to]);
      rr[o] = max(rr[o], rr[to]);
    }
  }
  int col[N << 2];
  void opt3(int o, int l, int r, int L, int R, int w) {
    if (L <= l && r <= R) {
      col[o] = w;
      return;
    }
    int mid = (l + r) >> 1;
    if (col[o]) {
      col[o << 1] = col[o << 1 | 1] = col[o];
      col[o] = 0;
    }
    if (mid >= L) opt3(o << 1, l, mid, L, R, w);
    if (mid < R) opt3(o << 1 | 1, mid + 1, r, L, R, w);
  }
  int opt4(int o, int l, int r, int i) {
    if (l == r) return col[o];
    int mid = (l + r) >> 1;
    if (col[o]) {
      col[o << 1] = col[o << 1 | 1] = col[o];
      col[o] = 0;
    }
    if (mid >= i)
      return opt4(o << 1, l, mid, i);
    else
      return opt4(o << 1 | 1, mid + 1, r, i);
  }
} T2;
int que[N][3];
struct b {
  int fa[N << 1], zong;
  void init() {
    zong = n;
    for (int i = 1; i <= n; ++i) fa[i] = i;
  }
  int find(int o) { return fa[o] == o ? o : fa[o] = find(fa[o]); }
  void merge(int x, int y) {
    int d1 = find(x), d2 = find(y);
    fa[++zong] = zong;
    fa[d1] = zong;
    fa[d2] = zong;
  }
} B1, B2;
int main() {
  scanf("%d%d", &n, &m);
  T1.init();
  T2.init();
  for (int i = 1; i <= m; ++i) {
    char s[10];
    scanf("%s", s);
    if (s[0] == 'U') {
      int x, y;
      scanf("%d%d", &x, &y);
      que[i][0] = 1;
      que[i][1] = x;
      que[i][2] = y;
      T1.merge(x, y);
    }
    if (s[0] == 'M') {
      int x, y;
      scanf("%d%d", &x, &y);
      que[i][0] = 2;
      que[i][1] = x;
      que[i][2] = y;
      T2.merge(x, y);
    }
    if (s[0] == 'A') {
      int x;
      scanf("%d", &x);
      que[i][0] = 3;
      que[i][1] = x;
    }
    if (s[0] == 'Z') {
      int x;
      scanf("%d", &x);
      que[i][0] = 4;
      que[i][1] = x;
    }
    if (s[0] == 'Q') {
      int x;
      scanf("%d", &x);
      que[i][0] = 5;
      que[i][1] = x;
    }
  }
  for (int i = 1; i <= T1.zong; ++i)
    if (T1.find(i) == i) T1.dfs(i);
  for (int i = 1; i <= T2.zong; ++i)
    if (T2.find(i) == i) T2.dfs(i);
  B1.init();
  B2.init();
  for (int i = 1; i <= m; ++i) {
    if (que[i][0] == 1) {
      B1.merge(que[i][1], que[i][2]);
    }
    if (que[i][0] == 2) {
      B2.merge(que[i][1], que[i][2]);
    }
    if (que[i][0] == 3) {
      ++T1.now;
      T1.opt1(T1.root[T1.now - 1], T1.root[T1.now], 1, n,
              T1.ll[B1.find(que[i][1])], T1.rr[B1.find(que[i][1])],
              T1.siz[B1.find(que[i][1])]);
    }
    if (que[i][0] == 4) {
      T2.opt3(1, 1, n, T2.ll[B2.find(que[i][1])], T2.rr[B2.find(que[i][1])],
              T1.now);
    }
    if (que[i][0] == 5) {
      printf("%lld\n", T1.opt2(T1.root[T1.now], 1, n, T1.ids[que[i][1]], 0) -
                           T1.opt2(T1.root[T2.opt4(1, 1, n, T2.ids[que[i][1]])],
                                   1, n, T1.ids[que[i][1]], 0));
    }
  }
}