n, m = map(int, input().split())
g = [[] for _ in range(n)]
inv = [0] * n
for _ in range(m):
    a, b = map(int, input().split())
    g[a - 1].append(b - 1)
    g[b - 1].append(a - 1)
    inv[a - 1] += 1
    inv[b - 1] += 1
s = []
for i in range(n):
    if inv[i] == 1:
        s.append(i)
ans = 0
d = [1] * n
while s:
    v = s.pop()
    d[v] = 0
    for node in g[v]:
        if d[node]:
            ans += 1
            inv[node] -= 1
            if inv[node] == 1:
                s.append(node)
if ans % 2 == 1:
    print('Yes')
else:
    print('No')