#include <bits/stdc++.h>

using i32 = std::int32_t;
using u32 = std::uint32_t;
using i64 = std::int64_t;
using u64 = std::uint64_t;
using i128 = __int128_t;
using u128 = __uint128_t;
using isize = std::ptrdiff_t;
using usize = std::size_t;

class rep {
    struct Iter {
        usize itr;
        constexpr Iter(const usize pos) noexcept : itr(pos) {}
        constexpr void operator++() noexcept { ++itr; }
        constexpr bool operator!=(const Iter& other) const noexcept { return itr != other.itr; }
        constexpr usize operator*() const noexcept { return itr; }
    };
    const Iter first, last;

  public:
    explicit constexpr rep(const usize first, const usize last) noexcept : first(first), last(std::max(first, last)) {}
    constexpr Iter begin() const noexcept { return first; }
    constexpr Iter end() const noexcept { return last; }
};

template <class T> using Vec = std::vector<T>;

void main_() {
    usize N, M;
    std::cin >> N >> M;
    Vec<std::set<usize>> graph(N);
    for (const auto i : rep(0, M)) {
        usize a, b;
        std::cin >> a >> b;
        a -= 1;
        b -= 1;
        graph[a].insert(b);
        graph[b].insert(a);
    }
    std::queue<usize> que;
    for (const auto u : rep(0, N)) {
        if (graph[u].size() == 1) {
            que.push(u);
        }
    }
    usize ans = 0;
    while (!que.empty()) {
        const auto u = que.front();
        que.pop();
        if (graph[u].size() != 1) {
            continue;
        }
        ans += 1;
        for (const auto v : graph[u]) {
            graph[v].erase(u);
            if (graph[v].size() == 1) {
                que.push(v);
            }
        }
        graph[u].clear();
    }
    std::cout << (ans % 2 == 1 ? "Yes" : "No") << '\n';
}

int main() {
    std::ios_base::sync_with_stdio(false);
    std::cin.tie(nullptr);
    main_();
    return 0;
}