import std.stdio, std.array, std.string, std.conv, std.algorithm;
import std.typecons, std.range, std.random, std.math, std.container;
import std.numeric, std.bigint, core.bitop;

void main() {
    auto s = readln.split.map!(to!int);
    auto N = s[0];
    auto M = s[1];
    auto G = new int[][](N);
    foreach (i; 0..M) {
        s = readln.split.map!(to!int);
        auto u = s[0] - 1;
        auto v = s[1] - 1;
        G[u] ~= v;
        G[v] ~= u;
    }

    auto q = new DList!int;
    foreach (i; 0..N) if (G[i].length == 1) q.insertBack(i);
    int ans = 0;

    while (!q.empty) {
        auto n = q.front;
        q.removeFront;
        if (G[n].length != 1) continue;
        ans += 1;
        auto m = G[n][0];
        G[n].popBack;
        foreach (i; 0..G[m].length.to!int) if (G[m][i] == n) {
            swap(G[m][i], G[m].back);
            G[m].popBack;
            if (G[m].length == 1) {
                q.insertBack(m);
            }
            break;
        }
    }

    writeln(ans % 2 ? "Yes" : "No");
}