#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
template<class T>bool chmax(T &a, const T &b) { if (a<b) { a=b; return true; } return false; }
template<class T>bool chmin(T &a, const T &b) { if (b<a) { a=b; return true; } return false; }
#define vi vector<int>
#define vl vector<ll>
#define vii vector<pair<int,int>>
#define vll vector<pair<ll,ll>>
#define vvi vector<vector<int>>
#define vvl vector<vector<ll>>
#define vvii vector<vector<pair<int,int>>>
#define vvll vector<vector<pair<ll,ll>>>
#define vst vector<string>
#define pii pair<int,int>
#define pll pair<ll,ll>
#define pb push_back
#define all(x) (x).begin(),(x).end()
#define mkunique(x) sort(all(x));(x).erase(unique(all(x)),(x).end())
#define fi first
#define se second
#define mp make_pair
#define si(x) int(x.size())
const int mod=998244353,MAX=300005,INF=15<<26;

int main(){
    
    std::ifstream in("text.txt");
    std::cin.rdbuf(in.rdbuf());
    cin.tie(0);
    ios::sync_with_stdio(false);
    
    int N,M;cin>>N>>M;
    cout<<"Yes\n";
    
    if(N<=4){
        for(int i=0;i<N;i++){
            cout<<i+1<<" ";
        }
        cout<<"\n";
        return 0;
    }
    vvi G(N);
    for(int i=0;i<M;i++){
        int a,b;cin>>a>>b;a--;b--;
        G[a].pb(b);
        G[b].pb(a);
    }
    queue<int> Q;
    vi ans(N,-1),S(N);
    for(int i=0;i<N;i++){
        if(si(G[i])==3){
            Q.push(i);
            ans[i]=0;
            S[i]=15;
            for(int j=0;j<3;j++){
                ans[G[i][j]]=j+1;
                S[G[i][j]]=15;
                Q.push(G[i][j]);
            }
            break;
        }
    }
    while(!Q.empty()){
        int u=Q.front();Q.pop();
        for(int to:G[u]){
            if(ans[to]==-1){
                S[to]|=(1<<ans[u]);
                if(__builtin_popcount(S[to])==3){
                    for(int i=0;i<4;i++){
                        if(!(S[to]&(1<<i))){
                            ans[to]=i;
                            Q.push(to);
                            S[to]=15;
                            break;
                        }
                    }
                }
            }
        }
    }
    
    for(int i=0;i<N;i++){
        cout<<ans[i]+1<<" ";
    }
    cout<<"\n";
}