import sys

# sys.setrecursionlimit(200005)
int1 = lambda x: int(x)-1
pDB = lambda *x: print(*x, end="\n", file=sys.stderr)
p2D = lambda x: print(*x, sep="\n", end="\n\n", file=sys.stderr)
def II(): return int(sys.stdin.readline())
def LI(): return list(map(int, sys.stdin.readline().split()))
def LLI(rows_number): return [LI() for _ in range(rows_number)]
def LI1(): return list(map(int1, sys.stdin.readline().split()))
def LLI1(rows_number): return [LI1() for _ in range(rows_number)]
def SI(): return sys.stdin.readline().rstrip()

dij = [(0, 1), (-1, 0), (0, -1), (1, 0)]
# dij = [(0, 1), (-1, 0), (0, -1), (1, 0), (1, 1), (1, -1), (-1, 1), (-1, -1)]
inf = (1 << 63)-1
# inf = (1 << 31)-1
# md = 10**9+7
md = 998244353

n, m = LI()
to = [set() for _ in range(n)]
for _ in range(m):
    u, v = LI1()
    to[u].add(v)
    to[v].add(u)

st = []
for u in range(n):
    if len(to[u]) == 1: st.append(u)

cnt = 0
while st:
    u = st.pop()
    if not to[u]: continue
    cnt ^= 1
    for v in to[u]:
        to[v].discard(u)
        if len(to[v]) == 1: st.append(v)

print("Yes" if cnt else "No")