#include <bits/stdc++.h>
using namespace std;

#define ll long long
#define rep(i, n) for (int i = 0; i < (n); i++)
#define P pair<int, int>

set<int> G[5010];

int main() {
  int n, m;
  cin >> n >> m;
  rep(i,m) {
    int a, b;
    cin >> a >> b;
    a--, b--;
    G[a].insert(b);
    G[b].insert(a);
  }

  queue<int> q;
  rep(i,n) {
    if (G[i].size() == 1) q.push(i);
  }
  int cnt = 0;
  while (!q.empty()) {
    int v = q.front(); q.pop();
    if (G[v].size() == 1) {
      cnt++;
      for (int nv : G[v]) {
        G[nv].erase(v);
        if (G[nv].size() == 1) q.push(nv);
      }
      G[v].clear();
    }
      //cout << v << " " << deg[v] << " " << nv << " " << deg[nv] << endl;
    
  }

  if (cnt%2) cout << "Yes" << endl;
  else cout << "No" << endl;




}