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)

INF = 10**18
G = [0 for _ in range(N)]
c = -1

for i in range(N):
  if G[i] == 0:
    c += 1
  que = deque([i])
  while que:
    v = que.popleft()
    for vv in l[v]:
      if not visited[v][vv]:
        G[v] += 1
        que.append(vv)
        visited[v][vv] = True

num = G.count(1)+c

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