#include <iostream>
#include <algorithm>
#include <string>
#include <vector>
#include <cmath>
#include <map>
#include <queue>
#include <iomanip>
#include <set>
#include <tuple>
#define mkp make_pair
#define mkt make_tuple
#define rep(i,n) for(int i = 0; i < (n); ++i)
#define all(v) v.begin(),v.end()
using namespace std;
typedef long long ll;
const ll MOD=1e9+7;
template<class T> void chmin(T &a,const T &b){if(a>b) a=b;}
template<class T> void chmax(T &a,const T &b){if(a<b) a=b;}

int main(){
  cin.tie(0);
  ios::sync_with_stdio(false);

  int N,M;
  cin>>N>>M;
  vector<int> A(N);
  rep(i,N) cin>>A[i];

  rep(i,N) A[i]--;

  for(int i=0;i+1<N;i++){
    if(A[i]==A[i+1]){
      cout<<"No"<<endl;
      return 0;
    }
  }
  for(int i=0;i+2<N;i++){
    if(A[i]==A[i+2]){
      cout<<"No"<<endl;
      return 0;
    }
  }

  for(int t=0;t<2;t++){
    vector<vector<int>> g(M);
    for(int i=0;i+1<N;i++){
      if(i%2==t){// >
        g[A[i+1]].push_back(A[i]);
      }else{
        g[A[i]].push_back(A[i+1]);
      }
    }

    vector<int> in(M,0);
    rep(i,M) for(auto to:g[i]) in[to]++;
    vector<int> ans(M,-1);
    int cnt=0;
    queue<int> Q;
    rep(i,M) if(in[i]==0){
      Q.push(i);
    }
    
    while(!Q.empty()){
      int now=Q.front();
      Q.pop();

      ans[now]=cnt++;

      for(auto nex:g[now]){
        in[nex]--;
        if(in[nex]==0) Q.push(nex);
      }
    }

    if(cnt==M){
      cout<<"Yes"<<endl;
      rep(i,M) cout<<ans[i]+1<<" ";
      cout<<endl;
      return 0;
    }
  }

  cout<<"No"<<endl;

  return 0;
}