#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define rep(i,n) for(int (i)=0;(i)<(n);(i)++)
#define Pr pair<ll,ll>
#define Tp tuple<ll,ll,ll>
using Graph = vector<vector<int>>;

const ll mod = 1000000007;

int main() {
    ll N,M;
    cin >> N >> M;
    Graph G(N+1);
    ll cnt[N+1];
    rep(i,N+1) cnt[i] = 0;
    rep(i,M){
        ll a,b; cin >> a >> b;
        G[a].push_back(b); G[b].push_back(a);
        cnt[a]++; cnt[b]++;
    }
    string ans = "Yes";
    int cnt2 = 0;
    //BFS (普通の幅優先探索)
    queue<int> go;
    rep(i,N){
        if(cnt[i+1]==1){
            go.push(i+1);
        }
    }
    bool rem[N+1];
    rep(i,N+1) rem[i] = true;
    while(!go.empty()){
        int s = go.front(); go.pop();
        rem[s] = false; cnt[s]--;
        for(int x:G[s]){
            if(rem[x]){
                cnt[x]--; cnt2++;
                if(cnt[x]==1) go.push(x);
            }
        }
    }

    if(cnt2%2==0) ans = "No";
    cout << ans << endl;
}