#include <bits/stdc++.h>
#pragma GCC optimize("Ofast")
#define _GLIBCXX_DEBUG
using namespace std;
using std::cout;
using std::cin;
using std::endl;
using ll=long long;
using ld=long double;
ll ILL=1167167167167167167;
const int INF=2100000000;
const ll mod=1e9+7;
#define rep(i,a) for (ll i=0;i<a;i++)
template<class T> using _pq = priority_queue<T, vector<T>, greater<T>>;
template<class T> ll LB(vector<T> &v,T a){return lower_bound(v.begin(),v.end(),a)-v.begin();}
template<class T> ll UB(vector<T> &v,T a){return upper_bound(v.begin(),v.end(),a)-v.begin();}
template<class T> bool chmin(T &a,const T &b){if(a>b){a=b;return 1;}else return 0;}
template<class T> bool chmax(T &a,const T &b){if(a<b){a=b;return 1;}else return 0;}
template<class T> void So(vector<T> &v) {sort(v.begin(),v.end());}
template<class T> void Sore(vector<T> &v) {sort(v.begin(),v.end(),[](T x,T y){return x>y;});}
void yneos(bool a){if(a) cout<<"Yes\n"; else cout<<"No\n";}

void solve();

//  rainy ~ 雨に打たれて ~
int main() {
	ios::sync_with_stdio(false);
	cin.tie(nullptr);
	
	int t=1;
	//cin>>t;
	rep(i,t) solve();
}

void solve(){
	int N,M;
	cin>>N>>M;
	vector<int> p(N),D(M);
	rep(i,N){
		cin>>p[i];
		p[i]--;
	}
	rep(i,N-2){
		if(p[i]==p[i+2]){
			yneos(0);
			return ;
		}
	}
	vector<vector<int>> G(M);
	rep(i,N-1){
		if((i%2==1)){
			D[p[i]]++;
			G[p[i+1]].push_back(p[i]);
		}else{
			D[p[i+1]]++;
			G[p[i]].push_back(p[i+1]);
		}
	}
	queue<int> q;
	vector<int> ans(M);
	rep(i,M){
		if(D[i]==0) q.push(i);
	}
	rep(i,M){
		if(q.empty()){
			yneos(0);
			return ;
		}
		int a=q.front();
		q.pop();
		ans[a]=M-i;
		for(auto x:G[a]){
			D[x]--;
			if(D[x]==0) q.push(x);
		}
	}
	yneos(1);
	rep(i,M){
		if(i) cout<<" ";
		cout<<ans[i];
	}
	cout<<"\n";
}