B'There 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: 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. The first line contains two integers n and m (1 xe2 x80 x89 xe2 x89 xa4 xe2 x80 x89n, xe2 x80 x89m xe2 x80 x89 xe2 x89 xa4 xe2 x80 x89105) -- 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 xe2 x80 x89 xe2 x89 xa4 xe2 x80 x89t xe2 x80 x89 xe2 x89 xa4 xe2 x80 x893). It is guaranteed that the input has at least one query of the third type. 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.'...