#include <bits/stdc++.h>
using namespace std;
using ll=long long;
int main(){
	cin.tie(nullptr);
	ios::sync_with_stdio(false);
	int n,m;
	cin>>n>>m;
	if(n==3){
		cout<<1<<" "<<2<<" "<<3<<endl;
		return 0;
	}
	vector<vector<int>> graph(n);
	vector<int> d(n);
	for(int i=0;i<m;i++){
		int u,v;
		cin>>u>>v;
		u--;v--;
		graph[u].push_back(v);
		graph[v].push_back(u);
		d[u]++;d[v]++;
	}
	queue<int> bfs;
	for(int i=0;i<n;i++){
		if(d[i]==3)bfs.push(i);
	}
	vector<int> v;
	while(!bfs.empty()){
		int x=bfs.front();
		v.push_back(x);
		bfs.pop();
		for(int y:graph[x]){
			d[y]--;
			if(d[y]==3)bfs.push(y);
		}
	}
	ranges::reverse(v);
	vector<int> ans(n,-1);
	for(int x:v){
		set<int> s{1,2,3,4};
		for(int y:graph[x]){
			if(s.count(ans[y]))s.erase(ans[y]);
		}
		ans[x]=*s.begin();
	}
	cout<<"Yes"<<endl;
	for(int i=0;i<n;i++)cout<<ans[i]<<(i+1==n?"\n":" ");
}