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

int main() {
	ios::sync_with_stdio(false);
    cin.tie(nullptr);
	int n, m; cin >> n >> m;
	vector<vector<int>> g(n);
	vector<int> deg(n);
	for (int i=0; i<m; i++) {
		int x, y; cin >> x >> y; x--; y--;
		g[x].push_back(y);
		g[y].push_back(x);
		deg[x]++;
		deg[y]++;
	}
	queue<int> q;
	vector<char> visited(n);
	for (int i=0; i<n; i++) if (deg[i] == 3) q.push(i);
	stack<int> s;
	while (!q.empty()) {
		auto x = q.front(); q.pop();
		if (visited[x]) continue;
		visited[x] = true;
		s.push(x);
		for (auto& y : g[x]) if (!visited[y]) {
			deg[y]--;
			if (deg[y] == 3) q.push(y);
		}
	}
	vector<int> ans(n);
	{
		int x=1;
		for (int i=0 ;i<n; i++) if (!visited[i]) ans[i] = x++;
	}
	while (!s.empty()) {
		auto x = s.top(); s.pop();
		int mask = 0;
		for (auto& y : g[x]) if (ans[y] != 0) mask |= 1<<ans[y];
		for (int i=1; i<=4; i++) if (!((mask>>i)&1)) {
			ans[x] = i;
			break;
		}
	}
	cout << "Yes" << endl;
	for (int i=0; i<n; i++) cout << ans[i] << " \n"[i==n-1];
}