CF1239D.Catowice City

In the Catowice city next weekend the cat contest will be held. However, the jury members and the contestants haven't been selected yet. There are $n$ residents and $n$ cats in the Catowice, and each resident has exactly one cat living in his house. The residents and cats are numbered with integers from $1$ to $n$, where the $i$-th cat is living in the house of $i$-th resident.

Each Catowice resident is in friendship with several cats, including the one living in his house. In order to conduct a contest, at least one jury member is needed and at least one cat contestant is needed. Of course, every jury member should know none of the contestants. For the contest to be successful, it's also needed that the number of jury members plus the number of contestants is equal to $n$.

Please help Catowice residents to select the jury and the contestants for the upcoming competition, or determine that it's impossible to do.

下周末，猫城（Catowice）将举办一场猫咪大赛。然而，评委成员和参赛猫咪尚未选定。猫城共有 $n$ 位居民和 $n$ 只猫咪，且每位居民家中恰好养着一只猫咪。居民与猫咪均用 $1$ 到 $n$ 的整数编号，其中第 $i$ 只猫咪住在第 $i$ 位居民家中。

每位猫城居民与若干只猫咪是朋友关系，其中包括自己家中的那只猫咪。为举办比赛，至少需要一名评委成员，且至少需要一只参赛猫咪。当然，每位评委成员都不能认识任何一只参赛猫咪。此外，为确保比赛顺利进行，评委人数与参赛猫咪数量之和必须恰好等于 $n$。

请帮助猫城居民为即将到来的比赛选出评委和参赛猫咪，或判定这是不可能的。

The first line contains an integer $t$ ($1 \le t \le 100\,000$), the number of test cases. Then description of $t$ test cases follow, where each description is as follows:

The first line contains integers $n$ and $m$ ($1 \le n \le m \le 10^6$), the number of Catowice residents and the number of friendship pairs between residents and cats.

Each of the next $m$ lines contains integers $a_i$ and $b_i$ ($1 \le a_i, b_i \le n$), denoting that $a_i$-th resident is acquaintances with $b_i$-th cat. It's guaranteed that each pair of some resident and some cat is listed at most once.

It's guaranteed, that for every $i$ there exists a pair between $i$-th resident and $i$-th cat.

Different test cases are separated with an empty line.

It's guaranteed, that the sum of $n$ over all test cases is at most $10^6$ and that the sum of $m$ over all test cases is at most $10^6$.

第一行包含一个整数 $t$（$1 \le t \le 100\,000$），表示测试用例的数量。随后是 $t$ 个测试用例的描述，每个测试用例的描述如下：

第一行包含两个整数 $n$ 和 $m$（$1 \le n \le m \le 10^6$），分别表示 Catowice 城市居民的数量以及居民与猫之间的友谊对数量。

接下来的 $m$ 行中，每行包含两个整数 $a_i$ 和 $b_i$（$1 \le a_i, b_i \le n$），表示第 $a_i$ 位居民与第 $b_i$ 只猫相识。保证任意一对居民与猫至多出现一次。

保证对每个 $i$，均存在第 $i$ 位居民与第 $i$ 只猫之间的一对关系。

不同测试用例之间以一个空行分隔。

保证所有测试用例中 $n$ 的总和不超过 $10^6$，且所有测试用例中 $m$ 的总和不超过 $10^6$。

For every test case print:

• "No", if it's impossible to select the jury and contestants.

• Otherwise print "Yes".

  In the second line print two integers $j$ and $p$ ($1 \le j$, $1 \le p$, $j + p = n$) — the number of jury members and the number of contest participants.

  In the third line print $j$ distinct integers from $1$ to $n$, the indices of the residents forming a jury.

  In the fourth line print $p$ distinct integers from $1$ to $n$, the indices of the cats, which will participate in the contest.

  In case there are several correct answers, print any of them.

对每个测试用例，输出：

• 若无法选出评审团成员和参赛者，则输出 "No"；
• 否则输出 "Yes"。

第二行输出两个整数 $j$ 和 $p$（$1 \le j$, $1 \le p$, $j + p = n$）—— 分别表示评审团成员人数和参赛者人数。

第三行输出 $j$ 个互不相同的整数，取值范围为 $1$ 到 $n$，表示组成评审团的居民的编号。

第四行输出 $p$ 个互不相同的整数，取值范围为 $1$ 到 $n$，表示将参加比赛的猫的编号。

若存在多种正确答案，输出任意一种即可。

In the first test case, we can select the first and the third resident as a jury. Both of them are not acquaintances with a second cat, so we can select it as a contestant.

In the second test case, we can select the second resident as a jury. He is not an acquaintances with a first and a third cat, so they can be selected as contestants.

In the third test case, the only resident is acquaintances with the only cat, so they can't be in the contest together. So it's not possible to make a contest with at least one jury and at least one cat.

In the fourth test case, each resident is acquaintances with every cat, so it's again not possible to make a contest with at least one jury and at least one cat.

在第一个测试用例中，我们可以选择第一位和第三位居民作为评委。他们均不熟悉第二只猫，因此可以将第二只猫选为参赛者。

在第二个测试用例中，我们可以选择第二位居民作为评委。他不熟悉第一只和第三只猫，因此这两只猫可以被选为参赛者。

在第三个测试用例中，唯一的一位居民与唯一的那只猫相互熟悉，因此他们不能同时参加比赛。故无法组织一场至少包含一名评委和一只参赛猫的比赛。

在第四个测试用例中，每位居民都熟悉每一只猫，因此同样无法组织一场至少包含一名评委和一只参赛猫的比赛。