#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i = 0; i < (n);i++)
#define sz(x) int(x.size())
typedef long long ll;
typedef pair<int,int> P;
struct UnionFind{
  vector<int> data;
  int __size;
  UnionFind(int sz) {
  data.assign(sz, -1);
  __size = sz;
  }
 
  bool unite(int x, int y) {
    x = find(x), y = find(y);
    if(x == y) return (false);
    if(data[x] > data[y]) swap(x, y);//親は負でサイズを保存
    __size--;
    data[x] += data[y];
    data[y] = x;
    return (true);
  }
 
  int find(int k) {
    if(data[k] < 0) return (k);
    return (data[k] = find(data[k]));
  }

  bool same(int x, int y){
    return find(x) == find(y);
  }
 
  int size(int k) {
    return (-data[find(k)]);
  }

  int unum() {
    return (__size);
  }
};
int main(){
  int n, m;
  cin >> n >> m;
  UnionFind uf(n);
  vector<int> in(n,0);
  int s = -1;
  rep(i, m) {
    int a, b;
    cin >> a >> b;
    uf.unite(a, b);
    in[a]++;
    in[b]++;
    s = a;
  }
  int cnt = 0;
  for (int i = 0; i < n; i++) cnt += in[i] % 2;
  bool f = true;
  for (int i = 0; i < n; i++) if (in[i]) f &= (uf.same(i, s)); 
  bool ok = ( f & (cnt == 0 | cnt == 2));
  if (ok) cout << "YES" << endl;
  else cout << "NO" << endl; 
  return 0;
}