#include <bits/stdc++.h>
using namespace std;
#include <atcoder/all>
using namespace atcoder;
using ll=long long;
using Graph=vector<vector<int>>;
#define MAX 2000000
#define MOD 1000000007
#define INF 1000000000000000000

int main(){
  int N,M;
  cin>>N>>M;
  Graph G(N);
  vector<int> cnt(N,0);
  for(int i=0;i<M;i++){
    int a,b;
    cin>>a>>b;
    a--;b--;
    G[a].push_back(b);
    G[b].push_back(a);
    cnt[a]++;
    cnt[b]++;
  }
  queue<int> q;
  for(int i=0;i<N;i++){
    if(cnt[i]==1){
      q.push(i);
    }
  }
  int ans=0;
  while(!q.empty()){
    int v=q.front();
    q.pop();
    if(cnt[v]!=1){
      continue;
    }
    ans++;
    cnt[v]--;
    for(auto nv:G[v]){
      if(cnt[nv]>0){
        cnt[nv]--;
        if(cnt[nv]==1){
          q.push(nv);
        }
      }
    }
  }
  ans%=2;
  if(ans==1){
    cout<<"Yes"<<endl;
  }else{
    cout<<"No"<<endl;
  }
}