#include <bits/stdc++.h>

using namespace std;

int main() {
    int n, m;
    cin >> n >> m;
    vector<vector<bool>> g(n, vector<bool>(n));
    vector<int> d(n);
    for (int i = 0; i < m;i++) {
        int a, b;
        cin >> a >> b;
        a--;
        b--;
        g[a][b] = true;
        g[b][a] = true;
        d[a]++;
        d[b]++;
    }

    queue<int> que;
    for (int i = 0; i < n;i++) {
        if(d[i] == 1) {
            que.push(i);
        }
    }

    int cnt = 0;
    while(!que.empty()) {
        int now = que.front();
        que.pop();
        if(d[now] == 0) {
            continue;
        }
        cnt++;
        d[now] = 0;
        for (int i = 0; i < n;i++) {
            if(g[now][i] && d[i] != 0) {
                d[i]--;
                if(d[i] == 1) {
                    que.push(i);
                }
            }
        }
    }

    if(cnt % 2 == 1) {
        cout << "Yes" << endl;
    } else {
        cout << "No" << endl;
    }

    return 0;
}