from collections import *
def f(G):
    Q = deque()
    S = set()
    N = len(G)
    ans = 0
    # count = dict((u, 0) for u in range(len(G)))
    count = [0] * N

    for u in range(N):
        for v in G[u]:
            count[v] += 1

    for u in range(N):
        if count[u] == 1:
            Q.append(u)
            
    anslst = deque()
    while Q:
        # print("test", count, Q, S)
        u = Q.pop()
        if u not in S:
            ans += 1
            S.add(u)
        anslst.append(u)
        for v in G[u]:
            count[v] -= 1
            count[u] -= 1
            if count[v] == 1:
                Q.append(v)
            if count[v] == 0:
                S.add(v)
            if count[u] == 1:
                Q.append(u)
            if count[u] == 0:
                S.add(u)
    return ans

import sys
readline = sys.stdin.readline


N, M = map(int, readline().split())
G = [[] for i in range(N)]
for i in range(M):
    A, B = map(int, input().split())
    A, B = A - 1, B - 1
    G[A].append(B)
    G[B].append(A)

print("Yes") if f(G) % 2 else print("No")