n, m = map(int, input().split())
G = [[] for i in range(n)]
for _ in range(m):
    a, b = map(int, input().split())
    a -= 1; b -= 1
    G[a].append(b); G[b].append(a)
visit = [0] * n
ans = 0
def dfs(v):
    global ans
    cnt = sum(visit[i] for i in G[v])
    if len(G[v]) - cnt != 1: return 
    visit[v] = 1
    ans += 1
    for u in G[v]:
        if not visit[u]: dfs(u)
for i in range(n):
    if len(G[i]) == 1:
        dfs(i)
print(["No", "Yes"][ans % 2])