Virtual contest is a way to take part in past contest, as close as possible to participation on time. It is supported only ICPC mode for virtual contests.
If you've seen these problems, a virtual contest is not for you - solve these problems in the archive.
If you just want to solve some problem from a contest, a virtual contest is not for you - solve this problem in the archive.
Never use someone else's code, read the tutorials or communicate with other person during a virtual contest.

binary search

data structures

dsu

trees

*3100

No tag edit access

The problem statement has recently been changed. View the changes.

×
D. Campus

time limit per test

2 secondsmemory limit per test

256 megabytesinput

standard inputoutput

standard outputOscolcovo 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:

- 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. - 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. - 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). - 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}.

Input

The first line contains two integers, *n* and *m* (1 ≤ *n*, *m* ≤ 5·10^{5}) — 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}.

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.

Codeforces (c) Copyright 2010-2023 Mike Mirzayanov

The only programming contests Web 2.0 platform

Server time: Jun/01/2023 14:37:15 (k2).

Desktop version, switch to mobile version.

Supported by

User lists

Name |
---|