import sys
from collections import deque
sys.setrecursionlimit(10**7)
def I(): return int(sys.stdin.readline().rstrip())
def MI(): return map(int,sys.stdin.readline().rstrip().split())
def LI(): return list(map(int,sys.stdin.readline().rstrip().split()))
def LI2(): return list(map(int,sys.stdin.readline().rstrip()))
def S(): return sys.stdin.readline().rstrip()
def LS(): return list(sys.stdin.readline().rstrip().split())
def LS2(): return list(sys.stdin.readline().rstrip())


N,M = MI()
Graph = [[] for _ in range(N+1)]
for _ in range(M):
    A,B = MI()
    Graph[A].append(B)
    Graph[B].append(A)

deg = [len(Graph[i]) for i in range(N+1)]
deq = deque([])
for i in range(1,N+1):
    if deg[i] == 1:
        deq.append(i)

flag = [0]*(N+1)
ans = 0
while deq:
    i = deq.pop()
    if flag[i] or deg[i] != 1:
        continue
    flag[i] = 1
    ans += 1
    for j in Graph[i]:
        deg[j] -= 1
        if deg[j] == 1:
            deq.append(j)

if ans % 2 == 1:
    print('Yes')
else:
    print('No')