#![allow(unused_imports)]
#![allow(non_snake_case, unused)]

use std::cmp::*;
use std::collections::*;
use std::ops::*;

// https://atcoder.jp/contests/hokudai-hitachi2019-1/submissions/10518254 より

macro_rules! eprint {
    ($($t:tt)*) => {{
        use ::std::io::Write;
        let _ = write!(::std::io::stderr(), $($t)*);
    }};
}
macro_rules! eprintln {
    () => { eprintln!(""); };
    ($($t:tt)*) => {{
        use ::std::io::Write;
        let _ = writeln!(::std::io::stderr(), $($t)*);
    }};
}
macro_rules! dbg {
    ($v:expr) => {{
        let val = $v;
        eprintln!("[{}:{}] {} = {:?}", file!(), line!(), stringify!($v), val);
        val
    }}
}

macro_rules! mat {
    ($($e:expr),*) => { Vec::from(vec![$($e),*]) };
    ($($e:expr,)*) => { Vec::from(vec![$($e),*]) };
    ($e:expr; $d:expr) => { Vec::from(vec![$e; $d]) };
    ($e:expr; $d:expr $(; $ds:expr)+) => { Vec::from(vec![mat![$e $(; $ds)*]; $d]) };
}

macro_rules! ok {
    ($a:ident$([$i:expr])*.$f:ident()$(@$t:ident)*) => {
        $a$([$i])*.$f($($t),*)
    };
    ($a:ident$([$i:expr])*.$f:ident($e:expr$(,$es:expr)*)$(@$t:ident)*) => { {
        let t = $e;
        ok!($a$([$i])*.$f($($es),*)$(@$t)*@t)
    } };
}

pub fn readln() -> String {
    let mut line = String::new();
    ::std::io::stdin().read_line(&mut line).unwrap_or_else(|e| panic!("{}", e));
    line
}

macro_rules! read {
    ($($t:tt),*; $n:expr) => {{
        let stdin = ::std::io::stdin();
        let ret = ::std::io::BufRead::lines(stdin.lock()).take($n).map(|line| {
            let line = line.unwrap();
            let mut it = line.split_whitespace();
            _read!(it; $($t),*)
        }).collect::<Vec<_>>();
        ret
    }};
    ($($t:tt),*) => {{
        let line = readln();
        let mut it = line.split_whitespace();
        _read!(it; $($t),*)
    }};
}

macro_rules! _read {
    ($it:ident; [char]) => {
        _read!($it; String).chars().collect::<Vec<_>>()
    };
    ($it:ident; [u8]) => {
        Vec::from(_read!($it; String).into_bytes())
    };
    ($it:ident; usize1) => {
        $it.next().unwrap_or_else(|| panic!("input mismatch")).parse::<usize>().unwrap_or_else(|e| panic!("{}", e)) - 1
    };
    ($it:ident; [usize1]) => {
        $it.map(|s| s.parse::<usize>().unwrap_or_else(|e| panic!("{}", e)) - 1).collect::<Vec<_>>()
    };
    ($it:ident; [$t:ty]) => {
        $it.map(|s| s.parse::<$t>().unwrap_or_else(|e| panic!("{}", e))).collect::<Vec<_>>()
    };
    ($it:ident; $t:ty) => {
        $it.next().unwrap_or_else(|| panic!("input mismatch")).parse::<$t>().unwrap_or_else(|e| panic!("{}", e))
    };
    ($it:ident; $($t:tt),+) => {
        ($(_read!($it; $t)),*)
    };
}


pub fn main() {
    let _ = ::std::thread::Builder::new().name("run".to_string()).stack_size(32 * 1024 * 1024).spawn(run).unwrap().join();
}

const MOD: usize = 998244353;
// const MOD: usize = 1_000_000_007;
const INF: i64 = std::i64::MAX;
// const INF: i128 = std::i128::MAX/100;

fn solve() {
    let (n,m) = read!(usize,usize);
    let a = read!([usize]);
    let mut edge = vec![vec![];m];
    let mut edge2 = vec![vec![];m];
    for i in 0..n-1 {
        if i%2==0 {
            edge[a[i]-1].push(a[i+1]-1);
            edge2[a[i+1]-1].push(a[i]-1);
        }
        else {
            edge[a[i+1]-1].push(a[i]-1);
            edge2[a[i]-1].push(a[i+1]-1);
        }
    }
    let ret = topo(&edge);
    let ret2 = topo(&edge2);
    if ret.len()==m {
        let mut ans = vec![0;m];
        for i in 0..m {
            ans[ret[i]] = i+1;
        }
        println!("Yes");
        for &a in &ans {
            print!("{} ",a);
        }
        println!();
        return;
    }
    if ret2.len()==m {
        let mut ans = vec![0;m];
        for i in 0..m {
            ans[ret2[i]] = i+1;
        }
        println!("Yes");
        for &a in &ans {
            print!("{} ",a);
        }
        println!();
        return;
    }
    println!("No");
}

fn topo(edge: &Vec<Vec<usize>>) -> Vec<usize> {
    let n = edge.len();
    let mut inner = vec![0;n];
    for i in 0..n {
        let mut val = vec![0;n];
        for &j in &edge[i] {
            inner[j] += 1;
            val[j] += 1;
        }
        for j in 0..n {
            if val[j]>1 {
                return vec![];
            }
        }
    }
    let mut q = VecDeque::new();
    for i in 0..n {
        if inner[i]==0 {
            q.push_back(i);
        }
    }
    let mut ans = vec![];
    while let Some(c) = q.pop_front() {
        ans.push(c);
        for &e in &edge[c] {
            inner[e] -= 1;
            if inner[e]==0 {
                q.push_back(e);
            }
        }
    }
    ans
}

fn run() {
    let stack_size = 104_857_600; // 100 MB
    let thd = std::thread::Builder::new().stack_size(stack_size);
    solve();
}