#include <bits/stdc++.h>
using namespace std;
using ll = long long;//63bit型整数型
int main(){
ll N,M;
cin >> N >> M;
vector<vector<ll>>graph(N,vector<ll>(0));
vector<ll>hen(N);
vector<ll>ans(N,-1);
vector<vector<bool>>valid(N,vector<bool>(4,true));
vector<ll>invalid(N,0);
for(int i = 0;i<M;i++){
    ll a,b;
    cin >> a >> b;
    a--;
    b--;
    graph[a].emplace_back(b);
    graph[b].emplace_back(a);
    hen[a]++;
    hen[b]++;
}
priority_queue<pair<ll,ll>>pq;
for(int i = 0;i<N;i++)if(hen[i]==3)pq.emplace(0,i);
while(true){
    if(pq.empty())break;
    auto[cnt,vertex] = pq.top();
    pq.pop();
    if(ans[vertex]!=-1)continue;
    ll x = -1;
    for(int i = 0;i<4;i++){
        if(valid[vertex][i]){
            x=i;
            break;
        }
    }
    ans[vertex]=x;
    for(int i = 0;i<graph[vertex].size();i++){
        ll p = graph[vertex][i];
        if(p==-1)continue;
        hen[p]--;
        hen[vertex]--;
        for(int ii = 0;ii<graph[p].size();ii++){
            if(graph[p][ii]==vertex){
                graph[p][ii]=-1;
                break;
            }
        }
        invalid[p]++;
        valid[p][x]=false;
        pq.emplace(invalid[p],p);
    }
}
cout << "Yes" << "\n";
for(int i = 0;i<N;i++)cout << ans[i]+1 << " ";
cout << "\n";
}