codeforces 791 B. Bear and Friendship Condition (DFS搜索)

B. Bear and Friendship Condition

time limit per test

1 second

memory limit per test

256 megabytes

input

standard input

output

standard output

Bear Limak examines a social network. Its main functionality is that two members can become friends (then they can talk with each other and share funny pictures).

There are n members, numbered 1 through n. m pairs of members are friends. Of course, a member can't be a friend with themselves.

Let A-B denote that members A and B are friends. Limak thinks that a network is reasonable if and only if the following condition is satisfied: For every three distinct members (X, Y, Z), if X-Y and Y-Z then alsoX-Z.

For example: if Alan and Bob are friends, and Bob and Ciri are friends, then Alan and Ciri should be friends as well.

Can you help Limak and check if the network is reasonable? Print "YES" or "NO" accordingly, without the quotes.

Input

The first line of the input contain two integers n and m (3 ≤ n ≤ 150 000, ) — the number of members and the number of pairs of members that are friends.

The i-th of the next m lines contains two distinct integers ai and bi (1 ≤ ai, bi ≤ n, ai ≠ bi). Members aiand bi are friends with each other. No pair of members will appear more than once in the input.

Output

If the given network is reasonable, print "YES" in a single line (without the quotes). Otherwise, print "NO" in a single line (without the quotes).

Examples

input

4 3
1 3
3 4
1 4

output

YES

input

4 4
3 1
2 3
3 4
1 2

output

NO

input

10 4
4 3
5 10
8 9
1 2

output

YES

input

3 2
1 2
2 3

output

NO

Note

The drawings below show the situation in the first sample (on the left) and in the second sample (on the right). Each edge represents two members that are friends. The answer is "NO" in the second sample because members (2, 3) are friends and members (3, 4) are friends, while members (2, 4) are not.

题意是关系具有传递性，x-y，y-z则就有x-z；给出n个人的m个关系，问给出的关系是否符合要求

DFS搜索，构成一个联通图，同一个联通图 中的每个节点的入度要满足图中元素个数-1；

代码：

#include <iostream>
#include<cstdio>
#include<cstring>
#include<vector>
#include<queue>
#define MAXN 150000+10
using namespace std;
vector<int> v[MAXN];
queue<int> q;
int degree[MAXN],vis[MAXN];
 void DFS(int u)
{
    vis[u]=1;
    q.push(u);
    for(int i=0;i<v[u].size();i++)
    {
        int num=v[u][i];
        if(!vis[num])
        {
            DFS(num);
        }
    }
}
int main()
{
    int n,m,a,b,flag;
    scanf("%d%d",&n,&m);
    for(int i=1;i<=n;i++)
        v[i].clear();
    memset(degree,0,sizeof(degree));
    for(int i=0;i<m;i++)
    {
        scanf("%d%d",&a,&b);
        v[a].push_back(b);
        v[b].push_back(a);
        degree[a]++;
        degree[b]++;
    }
    memset(vis,0,sizeof(vis));
    flag=0;
    for(int i=1;i<=n;i++)
    {
        if(!vis[i])
        {
            DFS(i);
            int Size=q.size();
            while(!q.empty())
            {
                int top=q.front();
                q.pop();
                if(degree[top]!=Size-1)
                {
                    flag=1;
                    break;
                }
            }
        }
        if(flag) break;
    }
    if(flag)
        printf("NO\n");
    else
        printf("YES\n");
    return 0;
}