The package for this problem was not updated by the problem writer or Codeforces administration after we've upgraded the judging servers. To adjust the time limit constraint, a solution execution time will be multiplied by 2. For example, if your solution works for 400 ms on judging servers, then the value 800 ms will be displayed and used to determine the verdict.

April Fools Day Contest 2013 |
---|

Finished |

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

*special problem

dfs and similar

graphs

greedy

*2800

No tag edit access

The problem statement has recently been changed. View the changes.

×
F. Greedy Petya

time limit per test

2 secondsmemory limit per test

256 megabytesinput

standard inputoutput

standard outputPetya is an unexperienced programming contestant. Recently he has come across the following problem:

You are given a non-directed graph which consists of *n* nodes and *m* edges. Your task is to determine whether the graph contains a Hamiltonian path.

Petya wrote a quick bug-free code which he believes solves this problem. After that Petya decided to give this problem for April Fools Day contest. Unfortunately, Petya might have made a mistake, and it's quite possible that his algorithm is wrong. But this isn't a good excuse to leave the contest without submitting this problem, is it?

Input

The first line contains two integers *n*, *m* (1 ≤ *n* ≤ 20; 0 ≤ *m* ≤ 400). Next *m* lines contain pairs of integers *v*_{i}, *u*_{i} (1 ≤ *v*_{i}, *u*_{i} ≤ *n*).

Output

Follow the format of Petya's code output.

Examples

Input

2 3

1 2

2 1

1 1

Output

Yes

Input

3 0

Output

No

Input

10 20

3 10

4 6

4 9

7 5

8 8

3 10

9 7

5 2

9 2

10 6

10 4

1 1

7 2

8 4

7 2

1 8

5 4

10 2

8 5

5 2

Output

No

Codeforces (c) Copyright 2010-2024 Mike Mirzayanov

The only programming contests Web 2.0 platform

Server time: May/26/2024 17:51:13 (l3).

Desktop version, switch to mobile version.

Supported by

User lists

Name |
---|