#include<iostream> #include<string> #include<vector> #include<stack> #include<queue> #include<set> #include<map> #include<algorithm> #include<numeric> #include<cmath> #include<iomanip> #include<regex> #include<random> using namespace std; #define int long long #define uint unsigned long long const int mod=1e9+7; const int inf=mod*mod; const double eps=1e-9; set<int>G[5000]; signed main(){ int n,m,a,b; cin>>n>>m; while(cin>>a>>b){ a--,b--; G[a].insert(b); G[b].insert(a); } stack<int>st; for(int i=0;i<n;i++) if(G[i].size()==1) st.push(i); int cnt=0; while(!st.empty()){ int v=st.top(); st.pop(); if(G[v].size()==1){ int u=*G[v].begin(); G[u].erase(v); if(G[u].size()==1) st.push(u); G[v].erase(u); cnt++; } } cout<<(cnt%2==1?"Yes":"No")<<endl; }