#include <iostream>
#include <vector>
#include <cmath>
#include <map>
#include <set>
#include <iomanip>
#include <queue>
#include <algorithm>
#include <numeric>
#include <deque>
#include <complex>
#include <cassert>

using namespace std;
using ll = long long;

int main(){

    int N, M, a, b, ans=0;
    cin >> N >> M;
    vector<vector<pair<int, int>>> E(N);
    vector<int> deg(N);
    queue<int> que;
    vector<bool> ok(M);
    for (int i=0; i<M; i++){
        cin >> a >> b; a--; b--;
        E[a].push_back({b, i});
        E[b].push_back({a, i});
        deg[a]++; deg[b]++;
    }

    for (int i=0; i<N; i++){
        if (deg[i] == 1) que.push(i);
    }

    while(!que.empty()){
        a = que.front();
        que.pop();
        deg[a]--;
        for (auto [x, i] : E[a]){
            ok[i] = 1;
            if (deg[x]){
                deg[x]--;
                if (deg[x] == 1) que.push(x);
            }
        }
    }

    for (int i=0; i<M; i++) if (ok[i]) ans++;

    cout << (ans % 2 == 1 ? "Yes" : "No") << endl;

    return 0;
}