CYPHER is well know for setting hard problems for the contest. During Code Apocalypse many teams were not able to solve single problem. So we decided to do something different for the next contest. We will allow teams to work together but only we can decide which teams will work together. If we say Team A can work with Team B and Team B can work with Team C then it means that Team A can also work with Team C and vice-versa.

Now we repeatedly announce two type of announcements.

First: J X Y which means Team X can work with Team Y.

Second: ? X Y were you have to find if Team X and Team Y can work together.

For every Second type of announcement you will tell yes if the team can work together and no if the teams cannot work together.

Output the total number of yes and number of no.

CONSTRAINT:

1<= t<= 10

1<=n<=10^5

1<=q<=10^5

INPUT:

First line contains an integer t denoting the number of test cases.

First line of each test case contains two integers n and q where n is the number of teams and q is the number of queries.

OUTPUT

For every second type of query print the total numbers of yes and total number of no.