#include <bits/stdc++.h>
#define rep(i,n) for(int i = 0; i < (n); i++)
using namespace std;
typedef long long ll;

int main(){
    cin.tie(0);
    ios::sync_with_stdio(0);
    
    int N,M; cin >> N >> M;
    vector<vector<int>> G(N);
    vector<int> deg(N, 0);
    rep(i,M) {
        int a,b; cin >> a >> b; a--; b--;
        G[a].push_back(b);
        G[b].push_back(a);
        deg[a]++, deg[b]++;
    }

    queue<int> q;
    rep(i,N) if(deg[i] == 1) q.push(i);
    int cnt = 0;
    while(!q.empty()) {
        int v = q.front(); q.pop();
        if(deg[v] == 0) continue;
        cnt++;
        for(int to : G[v]) if(--deg[to] == 1) q.push(to);
    }

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