#include <bits/stdc++.h> using namespace std; #define rep(i,n) for(int i=0;i<n;i++) #define per(i,n) for(int i=n-1;i>=0;i--) #define rng(i,c,n) for(int i=c;i<n;i++) #define fi first #define se second #define pb push_back #define all(a) a.begin(), a.end() #define sz(a) ((int) a.size()) #define vec(...) vector<__VA_ARGS__> #define _3TpP2FO ios::sync_with_stdio(0),cin.tie(0); typedef long long ll; typedef vector<int> vi; typedef pair<int,int> pii; void print(){cout<<'\n';} template<class h,class...t> void print(const h&v,const t&...u){cout<<v<<' ',print(u...);} void slv(){ int n,m; cin>>n>>m; vec(vi) adj(n); rep(i,m){ int u,v; cin>>u>>v; u-=1,v-=1; adj[u].pb(v),adj[v].pb(u); } vi qs(n,-1); auto dfs=[&](auto self,int v)->void{ for(auto u:adj[v]){ if(qs[u]==-1){ qs[u]=qs[v]^1; self(self,u); } } }; rep(v,n){ if(qs[v]!=-1) continue; qs[v]=0; dfs(dfs,v); } rep(v,n){ for(auto u:adj[v]){ if(qs[u]==qs[v]){ cout<<"No\n"; return; } } } cout<<"Yes\n"; } signed main(){ _3TpP2FO; slv(); }