#include <iostream>
#include <algorithm>
#include <vector>
#include <string>
using namespace std;
vector < vector<int> > g1(1000);
vector<int> used;
int k =1;
void dfs (int v) {
    used[v] = k;

    for (int i = 0 ; i < int(g1[v].size()); ++i)
        if (!used[g1[v][i]]){k =3-k;
            dfs (g1[v][i]);
}
        else if(used[g1[v][i]] == used[v]){cout << "NO";exit(0);}
}
int main() {
    ios::sync_with_stdio(0);cin.tie(NULL);cout.tie(NULL);
    int n;cin >> n;
    int m; cin >> m;
    for(int i = 0 ; i < m; i++){
        int x,y; cin >> x >> y;
        g1[x-1].push_back(y-1);
        g1[y-1].push_back(x-1);
    }
    for(int i = 0; i < n;i++) used.push_back(0);
    for(int i = 0; i < n; i++){
        if(used[i] == 0) dfs(i);
    }cout<<"YES" << '\n';
for(int i = 0; i < n;i++) cout << used[i] << ' ';
}