#!/usr/bin/env python3

import itertools


class UnionFind(object):

    def __init__(self, number_of_nodes):
        self.par = list(range(number_of_nodes))
        self.rank = [0] * number_of_nodes

    def root(self, node):
        if self.par[node] == node:
            return node
        else:
            r = self.root(self.par[node])
            self.par[node] = r
            return r

    def in_the_same_set(self, node1, node2):
        return self.root(node1) == self.root(node2)

    def unite(self, node1, node2):
        x = self.root(node1)
        y = self.root(node2)
        if x != y:
            if self.rank[x] < self.rank[y]:
                x, y = y, x
            self.par[y] = x
            if self.rank[x] == self.rank[y]:
                self.rank[x] += 1


def solve(num_vs, adj_list):
    uf = UnionFind(num_vs)
    for u, vs in enumerate(adj_list):
        for v in vs:
            uf.unite(u, v)
    vs = (v for v in range(num_vs) if len(adj_list[v]) > 0)
    for u, v in itertools.combinations(vs, 2):
        if not uf.in_the_same_set(u, v):
            return False
    num_odd_points = sum(len(vs) % 2 for vs in adj_list)
    return num_odd_points in (0, 2)


def main():
    n, m = (int(x) for x in input().split())
    # 多重辺が含まれうるので，隣接リストの各要素は集合ではなくリスト
    adj_list = [[] for _ in range(n)]
    for _ in range(m):
        sa, sb = (int(x) for x in input().split())
        adj_list[sa].append(sb)
        adj_list[sb].append(sa)
    res = solve(n, adj_list)
    print("YES" if res else "NO")


if __name__ == '__main__':
    main()