N, M = [int(x) for x in input().split()]
to = [[]*N for _ in range(N)]
for _ in range(M):
    a, b = [int(x)-1 for x in input().split()]
    to[a].append(b)
    to[b].append(a)

lst = []
loop = [0]*N
visited = [0]*N
def dfs(v, p=-1):
    if visited[v]: return
    visited[v] = 1
    for u in to[v]:
        if u == p: continue
        if u in lst:
            b = lst.index(u)
            for x in lst[b:]:
                loop[x] = 1
        else:
            lst.append(u)
            dfs(u, v)
            lst.pop()

for i in range(N):
    lst.append(i)
    dfs(i)
    lst.pop()
cnt = 0
for v in range(N):
    for u in to[v]:
        cnt += loop[v] and loop[u]
cnt //= 2
print('Yes' if (M-cnt)%2 else 'No')