from collections import deque

N,M = map(int,input().split())
l = [[] for _ in range(N)]
visited = [[False]*N for _ in range(N)]

for _ in range(M):
  a,b = map(int,input().split())
  a -= 1
  b -= 1
  l[a].append(b)
  l[b].append(a)

num = 0

for i in range(N):
  if len(l[i]) > 1:
    continue
  que = deque([i])
  while que:
    v = que.pop()
    c = 0
    for vv in l[v]:
      if visited[v][vv] or visited[vv][v]:
        c += 1
    if len(l[v])-c > 1:
      continue
    for vv in l[v]:
      if not visited[v][vv]:
        que.append(vv)
        visited[v][vv] = True
        visited[vv][v] = True
        num += 1

if num%2 != 0:
  print('Yes')
else:
  print('No')