QS Parliament

Time Limit: 5 Seconds    Memory Limit: 32768 KB

On a mystery island lives a tribe. What we only know about it is that the name of the resident on this island is QS. Recently, we payed attention to a special local activity among these QS's (pl.). They have an organization just like our parliament, each QS has its own power in the tribe, and no two QS's have the same power. To denote the power, each QS will gets a metal-card with a number on it, the less the number is, the bigger the power it denotes.

When a new year is coming, all QS's will fight for a better metal-card (with a less number). At first, each QS will get a random metal-card among all cards (with the number 1 to N). Then, there will be several rounds of fight to adjust the distribution. In each round, they will select two numbers A and B (range from 1 to N), and the current owners of these two numbers will fight with each other. Then the stronger QS will get the less number, on the contrary the weaker one will get the bigger one. Assume that there will be no draw.

Now, our question is that, after the adjusting, whether they can be assured that all the QS's will get their appropriate positions. It means that no such situation occurs: one QS is stronger than another but gets a bigger number finally.

Input

There are several test cases.

In each test case, the first line will contains two positive numbers N (1 <= N <= 15), M (M <= 500). N is the number of QS's, M is the number of fight rounds.

Each of the following M lines contains two numbers Ai and Bi, which define the numbers in this round.

Process to the end of input.

Output

For each test case, print "YES" if the adjusting is ok for any situation, otherwise "NO".

Sample Input

3 3
1 2
1 3
2 3

3 3
1 2
2 3
1 3

Sample Output

YES
NO

Submit

Source: Zhejiang University 2003 Summer Camp Qualification Contest