#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for(int i = 0; i < n; i++)
#define rep2(i, x, n) for(int i = x; i <= n; i++)
#define rep3(i, x, n) for(int i = x; i >= n; i--)
#define each(e, v) for(auto &e: v)
#define pb push_back
#define eb emplace_back
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
#define sz(x) (int)x.size()
using ll = long long;
using pii = pair<int, int>;
using pil = pair<int, ll>;
using pli = pair<ll, int>;
using pll = pair<ll, ll>;
const int MOD = 1000000007;
//const int MOD = 998244353;
const int inf = (1<<30)-1;
const ll INF = (1LL<<60)-1;
template<typename T> bool chmax(T &x, const T &y) {return (x < y)? (x = y, true) : false;};
template<typename T> bool chmin(T &x, const T &y) {return (x > y)? (x = y, true) : false;};

struct io_setup{
    io_setup(){
        ios_base::sync_with_stdio(false);
        cin.tie(NULL);
        cout << fixed << setprecision(15);
    }
} io_setup;

template<typename T, bool directed = false>
struct Table{
    vector<vector<T>> es;
    const T INF_T;
    const int n;

    vector<int> deg;

    inline const vector<T> &operator [] (int k) const{
        return es[k];
    }

    inline vector<T> &operator [] (int k){
        return es[k];
    }

    Table(int n) : es(n), INF_T(numeric_limits<T>::max()/2), n(n), deg(n, 0){
        for(int i = 0; i < n; i++) es[i].assign(n, INF_T);
        for(int i = 0; i < n; i++) es[i][i] = 0;
    }

    void add_edge(int from, int to, T cost = 1){
        es[from][to] = min(es[from][to], cost);
        if(!directed) es[to][from] = min(es[to][from], cost);
        deg[from]++, deg[to]++;
    }

    void solve(){
        queue<int> que;
        rep(i, n){
            if(deg[i] == 1) que.emplace(i);
        }
        int ans = 0;

        while(!empty(que)){
            int i = que.front(); que.pop();
            if(deg[i] != 1) continue; 
            rep(j, n){
                if(es[i][j] == 1){
                    deg[i]--, deg[j]--;
                    es[i][j] = 0, es[j][i] = 0;
                    if(deg[j] == 1) que.emplace(j);
                }
            }
            ans++;
        }

        cout << (ans&1 ? "Yes\n" : "No\n");
    }
};

int main(){
    int N, M; cin >> N >> M;

    Table<int> G(N);

    rep(i, M){
        int u, v; cin >> u >> v; u--, v--;
        G.add_edge(u, v);
    }

    G.solve();
}