#include<iostream>
#include<vector>
#include<algorithm>

using namespace std;
using ll = long long;

int main(){
    cin.tie(nullptr);
    ios::sync_with_stdio(false);

    int n,m;
    cin>>n>>m;
    vector<vector<int>> g(n);
    vector<int> cnt(n,0);
    for(int i = 0;i<m;i++){
        int u,v;
        cin>>u>>v;
        u--;v--;
        g[u].push_back(v);
        g[v].push_back(u);
        cnt[u]++;
        cnt[v]++;
    }
    vector<int> que;
    for(int i = 0;i<n;i++) if(cnt[i]==1) que.push_back(i);
    int use = 0;
    for(int i = 0;i<que.size();i++){
        int ni = que[i];
        if(cnt[ni]!=1) continue;
        use++;
        for(auto&to:g[ni]){
            cnt[to]--;
            if(cnt[to]==1) que.push_back(to);
        }
    }
    if(use%2==1) cout<<"Yes\n";
    else cout<<"No\n";
}