#include <bits/stdc++.h>
//#include <atcoder/all>
using namespace std;
// using namespace atcoder;
// using mint = modint1000000007;
// const int mod = 1000000007;
// using mint = modint998244353;
// const int mod = 998244353;
// const int INF = 1e9;
// const long long LINF = 1e18;
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rep2(i, l, r) for (int i = (l); i < (r); ++i)
#define rrep(i, n) for (int i = (n)-1; i >= 0; --i)
#define rrep2(i, l, r) for (int i = (r)-1; i >= (l); --i)
#define all(x) (x).begin(), (x).end()
#define allR(x) (x).rbegin(), (x).rend()
#define P pair<int, int>
template<typename A, typename B> inline bool chmax(A &a, const B &b) { if (a < b) { a = b; return true; } return false; }
template<typename A, typename B> inline bool chmin(A &a, const B &b) { if (a > b) { a = b; return true; } return false; }

int main() {
	std::ios::sync_with_stdio(false);
	std::cin.tie(nullptr);
	int n, m; cin >> n >> m;
	vector g(n, vector<int>());
	vector<int>deg(n);
	rep(i, m) {
		int u, v; cin >> u >> v;
		u--, v--;
		g[u].push_back(v);
		g[v].push_back(u);
		deg[u]++;
		deg[v]++;
	}
	queue<int>q;
	vector<bool>vis(n);
	rep(i, n) if (deg[i] == 3) q.push(i);
	stack<int>s;
	while (!q.empty()) {
		auto v = q.front();
		cout << v << endl;
		q.pop();
		if (vis[v])continue;
		s.push(v);
		vis[v] = true;
		for (auto nv : g[v]) {
			if (vis[nv])continue;
			deg[nv]--;
			if (deg[nv] == 3)q.push(nv);
		}
	}
	vector<int> ans(n);
	{
		int x = 1;
		rep(i, n)if (!vis[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];
		rep2(i, 1, 5)if (!(1 & (mask >> i))) {
			ans[x] = i;
			break;
		}
	}
	cout << "Yes" << endl;
	rep(i, n)cout << ans[i] << " ";
	cout << endl;
	return 0;
}