#include<bits/stdc++.h>
#include<atcoder/all>
using namespace std;
using namespace atcoder;
typedef long long int ll;
typedef long double ld;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef vector<vl> vvl;
typedef vector<vvl> vvvl;
typedef vector<vvvl> vvvvl;
typedef vector<bool> vb;
typedef vector<vb> vvb;
typedef vector<vvb> vvvb;
typedef vector<vvvb> vvvvb;
typedef pair<ll,ll> pl;
typedef pair<ll,pl> ppl;
typedef pair<ll,ppl> pppl;
typedef pair<ll,pppl> pppppl;
#define rep(i,a,b) for(int i=(a);i<(b);i++)
#define rrep(i,a,b) for(int i=(b)-1;i>=(a);i--)
#define all(a) begin(a),end(a)
#define sz(a) (int)(a).size()
#define F first
#define S second
#define bs(A,x) binary_search(all(A),x)
#define lb(A,x) (ll)(lower_bound(all(A),x)-A.begin())
#define ub(A,x) (ll)(upper_bound(all(A),x)-A.begin())
#define cou(A,x) (ll)(upper_bound(all(A),x)-lower_bound(all(A),x))
template<typename T>using min_priority_queue=priority_queue<T,vector<T>,greater<T>>;
template<class T>bool chmax(T&a,T b){if(a<b){a=b;return 1;}return 0;}
template<class T>bool chmin(T&a,T b){if(b<a){a=b;return 1;}return 0;}
//*
using mint=modint998244353;
const ll mod=998244353;
//*/
/*
using mint=modint1000000007;
const ll mod=1000000007;
//*/
//using mint=modint;
//*
typedef vector<mint> vm;
typedef vector<vm> vvm;
typedef vector<vvm> vvvm;
typedef vector<vvvm> vvvvm;
ostream&operator<<(ostream&os,mint a){os<<a.val();return os;}
istream&operator>>(istream&is,mint&a){int x;is>>x;a=mint(x);return is;}
//*/
template<typename T1,typename T2>ostream&operator<<(ostream&os,pair<T1,T2>p){os<<p.F<<" "<<p.S;return os;}
template<typename T1,typename T2>istream&operator>>(istream&is,pair<T1,T2>&p){is>>p.F>>p.S;return is;}
template<typename T>ostream&operator<<(ostream&os,vector<T>v){rep(i,0,sz(v))os<<v[i]<<(i+1!=sz(v)?" ":"");return os;}
template<typename T>istream&operator>>(istream&is,vector<T>&v){for(T&in:v)is>>in;return is;}
int main(){
  cin.tie(0)->sync_with_stdio(0);
  cin.exceptions(cin.failbit);
  ll N,M;cin>>N>>M;
  vvl E(N);
  rep(i,0,M){
  	ll u,v;cin>>u>>v;u--;v--;
  	E[u].emplace_back(v);
  	E[v].emplace_back(u);
  }
  vl deg(N);
  rep(i,0,N)deg[i]=sz(E[i]);
  queue<ll>Q;
  rep(i,0,N)if(deg[i]==3)Q.emplace(i);
  vb seen(N);
  vvl P(N);
  vl ord;
  while(sz(Q)){
  	ll v=Q.front();Q.pop();
  	if(deg[v]!=3)continue;
  	ord.emplace_back(v);
  	assert(deg[v]==3);
  	seen[v]=1;
  	for(auto u:E[v])if(!seen[u]){
  		deg[u]--;
  		P[v].emplace_back(u);
  		if(deg[u]==3)Q.emplace(u);
  	}
  }
  vl ans(N),T;
  rep(i,0,N)if(sz(P[i])==0)T.emplace_back(i);
  assert(sz(T)==3);
  ans[T[0]]=1;
  ans[T[1]]=2;
  ans[T[2]]=3;
  reverse(all(ord));
  //cout<<ord<<endl;
  //for(auto v:ord)cout<<v<<" ; "<<P[v]<<endl;
  for(auto v:ord){
  	auto Q=P[v];
  	assert(sz(Q)==3);
  	ans[v]=10-(ans[Q[0]]+ans[Q[1]]+ans[Q[2]]);
  }
  cout<<"Yes"<<endl<<ans<<endl;
  rep(i,0,N)for(auto j:E[i])assert(ans[i]!=ans[j]);
  return 0;
}