#include<bits/stdc++.h>
#include<atcoder/modint>
using namespace std;

int main(){
  int n,m;
  cin>>n>>m;
  vector<vector<int>> g(n);
  vector<int> d(n);
  for (int i=0;i<m;i++){
    int u,v;
    cin>>u>>v;
    u--;v--;
    d[u]++;
    d[v]++;
    g[u].push_back(v);
    g[v].push_back(u);
  }
  queue<int> q;
  vector<bool> vis(n);
  vector<int> vec;
  for (int i=0;i<n;i++) if (d[i]==3){
    vis[i]=true;
    q.push(i);
  }
  vector<vector<int>> g2(n);
  while (!q.empty()){
    int v=q.front();
    q.pop();
    vec.push_back(v);
    for (int u:g[v]){
      if (vis[u]) continue;
      g2[v].push_back(u);
      if (d[u]==3){
        vis[u]=true;
        q.push(u);
      }
    }
  }
  for (int i=0;i<n;i++) if (!vis[i]) vec.push_back(i);
  reverse(vec.begin(),vec.end());
  vector<int> c(n,-1);
  for (int i=0;i<3;i++) c[vec[i]]=i;
  for (int i=3;i<n;i++){
    assert(g2[vec[i]].size()==3);
    int val=0^1^2^3;
    for (int x:g2[vec[i]]){
      assert(c[x]>=0);
      val^=c[x];
    }
    c[i]=val;
  }
  cout<<"Yes\n";
  for (int i=0;i<n;i++) cout<<c[i]+1<<" \n"[i==n-1];
}