#!/usr/bin/env python3
# from typing import *

import sys
import io
import math
import collections
import decimal
import itertools
import bisect
import heapq


def input():
    return sys.stdin.readline()[:-1]


# sys.setrecursionlimit(1000000)

# _INPUT = """4 3
# 1 2
# 1 3
# 1 4

# """
# sys.stdin = io.StringIO(_INPUT)

INF = 10**10

YES = 'Yes'
NO = 'No'

N, M = map(int, input().split())
G = [list() for _ in range(N)]
InDegree = [0] * N
for _ in range(M):
    a, b = map(int, input().split())
    a -= 1
    b -= 1
    G[a].append(b)
    G[b].append(a)
    InDegree[a] += 1
    InDegree[b] += 1

L = [i for i in range(N) if InDegree[i] == 1]
n = 0
while L:
    p = L.pop()
    if InDegree[p] >= 1:
        n += 1
        InDegree[p] -= 1
        for p1 in G[p]:
            if InDegree[p1]:
                InDegree[p1] -= 1
                if InDegree[p1] == 1:
                    L.append(p1)

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