N,M=map(int,input().split())
graph=[[] for x in range(N)]
degree=[0]*N
for m in range(M):
    a,b=map(int,input().split())
    a-=1;b-=1
    graph[a].append(b)
    graph[b].append(a)
    degree[a]+=1
    degree[b]+=1
queue=[]
for x in range(N):
    if degree[x]==1:
        queue.append(x)
cnt=0
while queue:
    x=queue.pop()
    if degree[x]!=1:
        continue
    cnt+=1
    for y in graph[x]:
        degree[y]-=1
        if degree[y]==1:
            queue.append(y)
if cnt%2:
    ans="Yes"
else:
    ans="No"
print(ans)