Virtual contest is a way to take part in past contest, as close as possible to participation on time. It is supported only ACM-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.

No tag edit access

E. Information Graph

time limit per test

1 secondmemory limit per test

512 megabytesinput

standard inputoutput

standard outputThere are *n* employees working in company "X" (let's number them from 1 to *n* for convenience). Initially the employees didn't have any relationships among each other. On each of *m* next days one of the following events took place:

- either employee
*y*became the boss of employee*x*(at that, employee*x*didn't have a boss before); - or employee
*x*gets a packet of documents and signs them; then he gives the packet to his boss. The boss signs the documents and gives them to his boss and so on (the last person to sign the documents sends them to the archive); - or comes a request of type "determine whether employee
*x*signs certain documents".

Your task is to write a program that will, given the events, answer the queries of the described type. At that, it is guaranteed that throughout the whole working time the company didn't have cyclic dependencies.

Input

The first line contains two integers *n* and *m* (1 ≤ *n*, *m* ≤ 10^{5}) — the number of employees and the number of events.

Each of the next *m* lines contains the description of one event (the events are given in the chronological order). The first number of the line determines the type of event *t* (1 ≤ *t* ≤ 3).

- If
*t*= 1, then next follow two integers*x*and*y*(1 ≤*x*,*y*≤*n*) — numbers of the company employees. It is guaranteed that employee*x*doesn't have the boss currently. - If
*t*= 2, then next follow integer*x*(1 ≤*x*≤*n*) — the number of the employee who got a document packet. - If
*t*= 3, then next follow two integers*x*and*i*(1 ≤*x*≤*n*; 1 ≤*i*≤ [number of packets that have already been given]) — the employee and the number of the document packet for which you need to find out information. The document packets are numbered started from 1 in the chronological order.

It is guaranteed that the input has at least one query of the third type.

Output

For each query of the third type print "YES" if the employee signed the document package and "NO" otherwise. Print all the words without the quotes.

Examples

Input

4 9

1 4 3

2 4

3 3 1

1 2 3

2 2

3 1 2

1 3 1

2 2

3 1 3

Output

YES

NO

YES

Codeforces (c) Copyright 2010-2019 Mike Mirzayanov

The only programming contests Web 2.0 platform

Server time: Mar/23/2019 12:52:57 (f2).

Desktop version, switch to mobile version.

Supported by

User lists

Name |
---|