DSU#8798

DSU

1 second

64 megabytes

Easy

In Uzhlandia, there are $n$ cities, numbered from $1$ to $n$ . Initially, there are no roads between the cities, but roads will be built over time.

Tourist Vasyl asks you to answer $q$ queries of two types:

$1 a b$ — Construct a bidirectional road between cities $a$ and $b$ .
$2 a b$ — Determine whether it is possible to travel from city $a$ to city $b$ using the existing roads. Output YES if it is possible, otherwise output NO.

\InputFileThe first line contains the integers $n$ and $q$ ( $1 \leq n$ 1 \leq n, $q \leq 2 \times 1 0^{5}$ q \leq 2 \times 10^5).

The following $q$ lines each contain a query as described above.

\OutputFileFor each query of type $2$ , output the answer on a separate line.

Examples

Example 1

Loading

1 \leq n

q \leq 2 \times 1 0^{5}