#include<bits/stdc++.h>
using namespace std;

#define rep(i, a, n) for(int i=(a); i<(n); ++i)
#define per(i, a, n) for(int i=(a); i>(n); --i)
#define pb emplace_back
#define mp make_pair
#define clr(a, b) memset(a, b, sizeof(a))
#define all(x) (x).begin(),(x).end()
#define lowbit(x) (x & -x)
#define fi first
#define se second
#define lson o<<1
#define rson o<<1|1
#define gmid l[o]+r[o]>>1

using LL = long long;
using ULL = unsigned long long;
using pii = pair<int,int>;
using PLL = pair<LL, LL>;
using UI = unsigned int;

const int mod = 1e9 + 7;
const int inf = 0x3f3f3f3f;
const double EPS = 1e-8;
const double PI = acos(-1.0);

const int N = 1e5 + 10;

int n, m, a[N], x[N], deg[N];
vector<int> V[N];

bool ok(bool f){
	rep(i, 3, n+1){
		if(a[i] == a[i-2])	return 0;
	}
	rep(i, 1, m+1){
		V[i].clear();
		deg[i] = 0;
	}
	rep(i, 1, n){
		if(f){
			V[a[i]].pb(a[i+1]);
			++deg[a[i+1]];
		} else {
			V[a[i+1]].pb(a[i]);
			++deg[a[i]];
		}
		f ^= 1;
	}
	int v, cnt = 0;
	int val = 0;
	queue<int> Q;
	rep(i, 1, m+1){
		if(deg[i] == 0){
			Q.emplace(i);
		} else {
			x[i] = 0;
		}
	}
	while(!Q.empty()){
		v = Q.front(); Q.pop();
		++cnt;
		x[v] = ++val;

		for(int j : V[v]){
			if(--deg[j] == 0){
				Q.emplace(j);
			}
		}
	}

	return cnt == m;
}

int main(){
	scanf("%d %d", &n, &m);
	rep(i, 1, n+1)	scanf("%d", a+i);
	
	if(ok(0)){
		puts("Yes");
		rep(i, 1, m+1)	printf("%d%c", x[i], i==m?'\n':' ');
	} else if(ok(1)){
		puts("Yes");
		rep(i, 1, m+1)	printf("%d%c", x[i], i==m?'\n':' ');
	} else {
		puts("No");
	}

	return 0;
}