// 三角形じゃなく正四面体の面をくっつけてく操作をイメージ

use std::collections::*;

type Set<T> = BTreeSet<T>;

fn main() {
    input! {
        n: usize,
        m: usize,
        e: [(usize1, usize1); m],
    }
    let mut g = vec![Set::new(); n];
    for &(a, b) in e.iter() {
        g[a].insert(b);
        g[b].insert(a);
    }
    let mut dfs = vec![];
    let mut child = vec![vec![]; n];
    for i in 0..n {
        if g[i].len() == 3 {
            dfs.push(i);
        }
    }
    let mut deg = vec![0; n];
    let mut parent = vec![vec![]; n];
    while let Some(v) = dfs.pop() {
        if g[v].len() != 3 {
            continue;
        }
        parent[v].extend(g[v].iter().cloned());
        for u in g[v].clone() {
            deg[v] += 1;
            child[u].push(v);
            g[v].remove(&u);
            g[u].remove(&v);
            if g[u].len() == 3 {
                dfs.push(u);
            }
        }
    }
    let mut ans = vec![0; n];
    let mut k = 1;
    let mut deq = VecDeque::new();
    for i in 0..n {
        if g[i].len() > 0 {
            ans[i] = k;
            k += 1;
            for &u in child[i].iter() {
                deg[u] -= 1;
                if deg[u] == 0 {
                    deq.push_back(u);
                }
            }
        }
    }
    while let Some(v) = deq.pop_front() {
        ans[v] = (1..=4).find(|&c| parent[v].iter().all(|p| ans[*p] != c)).unwrap();
        for &u in child[v].iter() {
            deg[u] -= 1;
            if deg[u] == 0 {
                deq.push_back(u);
            }
        }
    }
    println!("Yes");
    use util::*;
    println!("{}", ans.iter().join(" "));
}

// ---------- begin input macro ----------
// reference: https://qiita.com/tanakh/items/0ba42c7ca36cd29d0ac8
#[macro_export]
macro_rules! input {
    (source = $s:expr, $($r:tt)*) => {
        let mut iter = $s.split_whitespace();
        input_inner!{iter, $($r)*}
    };
    ($($r:tt)*) => {
        let s = {
            use std::io::Read;
            let mut s = String::new();
            std::io::stdin().read_to_string(&mut s).unwrap();
            s
        };
        let mut iter = s.split_whitespace();
        input_inner!{iter, $($r)*}
    };
}

#[macro_export]
macro_rules! input_inner {
    ($iter:expr) => {};
    ($iter:expr, ) => {};
    ($iter:expr, $var:ident : $t:tt $($r:tt)*) => {
        let $var = read_value!($iter, $t);
        input_inner!{$iter $($r)*}
    };
}

#[macro_export]
macro_rules! read_value {
    ($iter:expr, ( $($t:tt),* )) => {
        ( $(read_value!($iter, $t)),* )
    };
    ($iter:expr, [ $t:tt ; $len:expr ]) => {
        (0..$len).map(|_| read_value!($iter, $t)).collect::<Vec<_>>()
    };
    ($iter:expr, chars) => {
        read_value!($iter, String).chars().collect::<Vec<char>>()
    };
    ($iter:expr, bytes) => {
        read_value!($iter, String).bytes().collect::<Vec<u8>>()
    };
    ($iter:expr, usize1) => {
        read_value!($iter, usize) - 1
    };
    ($iter:expr, $t:ty) => {
        $iter.next().unwrap().parse::<$t>().expect("Parse error")
    };
}
// ---------- end input macro ----------
mod util {
    pub trait Join {
        fn join(self, sep: &str) -> String;
    }

    impl<T, I> Join for I
    where
        I: Iterator<Item = T>,
        T: std::fmt::Display,
    {
        fn join(self, sep: &str) -> String {
            let mut s = String::new();
            use std::fmt::*;
            for (i, v) in self.enumerate() {
                if i > 0 {
                    write!(&mut s, "{}", sep).ok();
                }
                write!(&mut s, "{}", v).ok();
            }
            s
        }
    }
}