#include <iostream> #include <string> #include <vector> #include <queue> using namespace std; const int maxn=5100; vector<int> G[maxn]; queue<int> q; int degree[maxn]; int main(){ ios::sync_with_stdio(false); int N;int M; cin>>N>>M; for(int i=1;i<=M;i++){ int a, b; cin>>a>>b; G[a].push_back(b); G[b].push_back(a); degree[a]+=1; degree[b]+=1; } for(int i=1;i<=N;i++){ if(degree[i]==1) q.push(i); } int ans=0; while (!q.empty()){ int t=q.front(); if(degree[t]==0){ q.pop(); continue;; } ans+=1; q.pop(); for(int to:G[t]){ degree[to]-=1; if(degree[to]==1) q.push(to); } } if(ans%2==1){ cout<<"Yes"<<endl; }else{ cout<<"No"<<endl; } return 0; }