#include <bits/stdc++.h>
#include <atcoder/all>
typedef long long int ll;
typedef long long int ull;
#define MP make_pair
using namespace std;
using namespace atcoder;
typedef pair<ll, ll> P;
// #define MOD 998244353
#define MOD 1000000007
// using mint = modint998244353;
using mint = modint1000000007;
const double pi = 3.1415926536;
const int MAX = 2000003;
long long fac[MAX], finv[MAX], inv[MAX];
// テーブルを作る前処理
void COMinit() {
    fac[0] = fac[1] = 1;
    finv[0] = finv[1] = 1;
    inv[1] = 1;
    for (int i = 2; i < MAX; i++){
        fac[i] = fac[i - 1] * i % MOD;
        inv[i] = MOD - inv[MOD%i] * (MOD / i) % MOD;
        finv[i] = finv[i - 1] * inv[i] % MOD;
    }
}
// 二項係数計算
long long COM(int n, int k){
    if (n < k) return 0;
    if (n < 0 || k < 0) return 0;
    return fac[n] * (finv[k] * finv[n - k] % MOD) % MOD;
}
ll gcd (ll x, ll y) {
   if (y == 0) return x;
   else if (y > x) {
       return gcd (y, x); 
   }
   else return gcd(x % y, y);
}
ll lcm (ll x, ll y) {
   return x / gcd(x, y) * y;
}
ll my_sqrt(ll x) {
    ll m = 0;
    ll M = 1000000001;
    while (M - m > 1) {
        ll now = (M + m) / 2;
        if (now * now <= x) {
            m = now;
        }
        else {
            M = now;
        }
    }
    return m;
}
ll keta(ll n) {
    ll ret = 0;
    while (n) {
        n /= 10;
        ret++;
    }
    return ret;
}
ll ceil(ll n, ll m) {
    ll ret = n / m;
    if (n % m) ret++;
    return ret;
}

bool connect[5001][5001];
int deg[5001];
int main() {
    int n, m;
    cin >> n >> m;
    for (int i = 1; i <= 5000; i++) {
        for (int j = 1; j <= 5000; j++) {
            connect[i][j] = false;
        }
    }
    for (int i = 1; i <= m; i++) {
        int a, b;
        cin >> a >> b;
        connect[a][b] = true;
        connect[b][a] = true;
    }
    queue<int> que;
    for (int i = 1; i <= n; i++) {
        int cnt = 0;
        for (int j = 1; j <= n; j++) {
            if (connect[i][j]) cnt++;
        }
        deg[i] = cnt;
        if (deg[i] == 1) {
            que.push(i);
        }
    }
    int num = 0;
    while (que.size()) {
        int x = que.front();
        que.pop();
        int y = -1;;
        for (int i = 1; i <= n; i++) {
            if (connect[x][i]) y = i;
        }
        if (y == -1) continue;
        num++;
        deg[x]--;
        deg[y]--;
        if (deg[y] == 1) {
            que.push(y);
        }
        connect[x][y] = false;
        connect[y][x] = false;
    }
    if (num % 2) {
        cout << "Yes" << endl;
    }
    else {
        cout << "No" << endl;
    }
    return 0;
}