#include<bits/stdc++.h>
// #include<atcoder/all>

using namespace std;
// using namespace atcoder;
using ll = long long;
using ull = unsigned long long;
using P = pair<int,int>;
#define rep(i,n) for(ll i = 0;i < (ll)n;i++)
#define ALL(x) (x).begin(),(x).end()
#define MOD 1000000007

// 2021/1/14
vector<int> topological_sort(vector<vector<int>> &v){
  int n = v.size();
  vector<int> deg(n);
  vector<int> ord;
  for(int i = 0;i < n;i++){
    for(auto &to : v[i])deg[to]++;
  }
  stack<int> sck;
  for(int i = 0;i < n;i++)if(deg[i] == 0)sck.push(i);
  while(!sck.empty()){
    int ov = sck.top();sck.pop();
    ord.push_back(ov);
    for(auto nv : v[ov]){
      deg[nv]--;
      if(deg[nv] == 0)sck.push(nv);
    }
  }
  return ord;
}

int main(){
  

  int n,m;
  cin >> n >> m;
  vector<int> a(n);
  vector<vector<int>> v(m);
  rep(i,n)cin >> a[i],a[i]--;
  rep(i,n-2)if(a[i] == a[i+2]){
    cout << "No\n";
    return 0;
  }
  rep(i,n){
    if(i & 1){
      v[a[i-1]].push_back(a[i]);
      if(i+1 < n)v[a[i+1]].push_back(a[i]);
    }
  }
  rep(i,m){
    sort(ALL(v[i]));
    v[i].erase(unique(ALL(v[i])),v[i].end());
  }
  vector<int> ord(topological_sort(v));
  if(ord.size() != m){
    cout << "No\n";
  }else{
    cout << "Yes\n";
    vector<int> res(m,-1);
    int nu = 1;
    rep(i,m)res[ord[i]] = nu++;
    rep(i,m)cout << res[i] << " \n"[i+1 == m];
  }
  

  

  return 0;
}