#include <iostream>
#include <vector>
#include <string>
#include <algorithm>
using namespace std;
using ll = long long;
using ull = unsigned long long;
#define rep(i,n) for(int i=0; i<(n); i++) 


int N,M;
vector<vector<int>> E;
vector<int> I;

int main(){
  cin >> N >> M;
  E.resize(N);
  I.assign(N,0);
  rep(i,M){
    int u,v; cin >> u >> v; u--; v--;
    E[u].push_back(v);
    E[v].push_back(u);
    I[u]++;
    I[v]++;
  }

  int ans = 0;
  while(true){
    int id = -1;
    rep(i,N) if(I[i] == 1) id = i;
    if(id == -1) break;
    I[id]--;
    for(int e : E[id]) I[e]--;
    ans ^= 1;
  }
  cout << vector<string>{"No\n","Yes\n"}[ans];

  return 0;
}

struct ios_do_not_sync{
  ios_do_not_sync(){
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
  }
} ios_do_not_sync_instance;