## https://yukicoder.me/problems/no/1610

from collections import deque

def main():
    N, M = map(int, input().split())
    next_nodes = [set() for _ in range(N)]
    for _ in range(M):
        a, b = map(int, input().split())
        next_nodes[a - 1].add(b - 1)
        next_nodes[b - 1].add(a - 1)
    
    queue = deque()
    for i in range(N):
        if len(next_nodes[i]) == 1:
            queue.append(i)
    
    answer = 0
    while len(queue) > 0:
        v = queue.popleft()
        if len(next_nodes[v]) == 0:
            continue
        answer += 1
        for w in next_nodes[v]:
            next_nodes[w].remove(v)
            if len(next_nodes[w]) == 1:
                queue.append(w)
        next_nodes[v].clear()

    if answer % 2 == 1:
        print("Yes")
    else:
        print("No")












if __name__ == "__main__":
    main()