#include <bits/stdc++.h>
using namespace std;
int main(){
    int N, M;
    cin >> N >> M;
    vector<vector<int>> G(N);
    vector<int> cnt(N);
    for(int i = 0; i < M; i++){
        int a, b;
        cin >> a >> b;
        a--;
        b--;
        G[a].push_back(b);
        G[b].push_back(a);
       cnt[a]++;
       cnt[b]++;
    }
    queue<int> q;
    for(int i = 0; i < N; i++){
        if(cnt[i] == 1) q.push(i);
    }
    int ans = 0;
    while(!q.empty()){
        int t = q.front();
        q.pop();
        if(cnt[t] != 1) continue;
        ans++;
        for(int to: G[t]){
            cnt[to]--;
            if(cnt[to] == 1){
                q.push(to);
            }
        }
    }
    if(ans % 2 == 1) cout << "Yes" << endl;
    else cout << "No" << endl;

}