#include <bits/stdc++.h>
using namespace std;

int main() {
    int N,M;
    cin >> N >> M;
    vector<vector<int>>road(N);
    vector<int>cnt(N);
    for(int i = 0; i < M; i++) {
        int A,B;
        cin >> A >> B;
        A--;
        B--;
        cnt[A]++;
        cnt[B]++;
        road[A].push_back(B);
        road[B].push_back(A);
    }
    queue<int>que;
    int ans = 0;
    for(int i = 0; i < N; i++) {
        if(cnt[i] == 1) {
            que.push(i);
            while (!que.empty()) {
                int x = que.front();
                que.pop();
                for(int i = 0; i < road[x].size(); i++) {
                    cnt[road[x][i]]--;
                    cnt[x]--;
                    if(cnt[road[x][i]] == 1) {
                        ans++;
                        que.push(road[x][i]);
                    }
                }
            }
            ans++;
        }
    }
    cout << ((ans%2)?"Yes":"No") << endl;
}