//bfs实现
include[HTML_REMOVED]
include[HTML_REMOVED]
using namespace std;
const int N=1e5+10,M=2e5+10;
int h[N],e[M],ne[M],idx;
int color[N];
void add_(int a,int b){
e[idx]=b;
ne[idx]=h[a];
h[a]=idx;
}
int qu[N],hh,tt=-1;
int main(){
int n,m;
cin>>n>>m;
int a,b;
memset(h,-1,sizeof h);
while(m–){
scanf(“%d%d”,&a,&b);
add_(a,b);
add_(b,a);
}
int qq;
bool flag1=true;
for(int i=1;i<=n;i)
{
if(color[i]) continue;
else {color[i]=1;qu[tt]=i;}
while(tt>=hh){
qq=qu[hh];
hh;
bool flag=false;
for(int i=h[qq];i!=-1;i=ne[i]){
if(color[e[i]]==0){
if(color[qq]==1) color[e[i]]=2;
else color[e[i]]=1;
qu[++tt]=e[i];
}
else{
if(color[e[i]]==color[qq]){
flag1=false;
flag=true;
break;
}
}
}
if(flag) break;
}
}
if(flag1) cout<<"Yes"<<endl;
else cout<<"No"<<endl;
return 0;
}