Tom, Jerry and the Unshakable Blueprint

Limits: 2 sec., 512 MiB

Tom has sketched a huge map of secret tunnels and mouse-holes in the house. The map can be represented as a connected undirected graph with \(n\) vertices and \(m\) edges. Each hole is a vertex, and each bidirectional tunnel is an edge. The whole map is connected.

Jerry wants to pick a skeleton blueprint — a spanning tree of the map — to move silently without cycles.

Jerry believes that no matter which spanning tree he chooses, the “traffic profile” of the blueprint — i.e., the multiset of vertex degrees within that spanning tree — is always the same. Tom thinks Jerry is wrong and claims that some graphs admit two spanning trees with different degree multisets.

Your task is to settle their bet.

Input

The first line contains two integers \(n\) and \(m\) — the number of vertices and edges.

The next \(m\) lines each contain two integers \(u\) and \(v\) describing an undirected edge \((u, v)\).

Output

Print Yes if all spanning trees of the graph have the same degree multiset, otherwise print No.

Constraints

\(1 \le n \le 10^5\),

\(1 \le m \le 2 \cdot 10^5\).

\(1 \le u, v \le n\).

The graph is guaranteed to be connected and simple.

Samples