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 a_j merges with university b_j. After that all the dormitories that belonged to university b_j are assigned to to university a_j, and university b_j disappears.
2. Military office c_j merges with military office d_j. After that all the dormitories that were assigned to military office d_j, are assigned to military office c_j, and military office d_j disappears.
3. Students of university x_j move in dormitories. Lets k_xj 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 x_j increases by k_xj (note that the more dormitories belong to the university, the more students move in each dormitory of the university).
4. Military office number y_j 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 q_j.

The first line contains two integers, n and m (1 ≤ n, m ≤ 5·10⁵) — 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 a_j b_j» — merging universities;
• «M c_j d_j» — merging military offices;
• «A x_j» — students of university x_j moving in the dormitories;
• «Z y_j» — a raid in military office y_j;
• «Q q_j» — a query asking the number of people in dormitory q_j.

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