G - Bear and Friendship Condition（并查集+无向完全图）

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 also X-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 ai and 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.

题意：若A-B，B-C则必有A-C；那么不难得到只要一个是一个连通图，则其两两之间必有连边，即为无向完全图。其边数为Cn2,即从n个数任意选取两个数组合。为n*(n-1)/2；由于n最大为150000，则边数最大可达1.125*10^10越过int类型，要用强制类型转换或者直接开long long 的num数组。

感受：思路本是很清晰的一道题，还是对知识掌握的不牢固，还有不能正确快速的将实际问题转化为数学或算法问题。

#include<iostream>
#include<cstring>
using namespace std;
typedef long long ll;
const int maxn=150050;
int f[maxn],num[maxn];//f为并查集，num为元素个数
ll n,m,sum;
void Init()
{
    for(int i=1;i<=n;i++)
        f[i]=i,num[i]=1;
}
int getf(int x)
{
    return f[x]==x?x:f[x]=getf(f[x]);
}
void merge_(int u,int v)
{
    u=getf(u);
    v=getf(v);
    if(u!=v)
    {
        f[v]=u;
        num[u]+=num[v];  //将一个集合的元素个数合并到另一个集合中1
    }
}
int main()
{
    cin>>n>>m;
    Init();
    for(int i=1;i<=m;i++)
    {
        int x,y;
        cin>>x>>y;
        merge_(x,y);
    }
    for(int i=1;i<=n;i++)
    {
        if(f[i]==i)
        {
            sum+=((ll)num[i]*(num[i]-1))/2;//计算的边数最大为1.125*10^10左右，会越界，要用ll强制类型转换，或者直接开ll的num数组
        }
    }
    if(sum==m)
        cout<<"YES"<<endl;
    else
        cout<<"NO"<<endl;
    return 0;
}