#include <iostream>
#include <string>
#include <algorithm>
#include <vector>
#include <iomanip>
#include <cmath>
#include <stdio.h>
#include <queue>
#include <deque>
#include <cstdio>
#include <set>
#include <map>
#include <bitset>
#include <stack>
#include <cctype>
using namespace std;
bool b[100010] = { false };
int a[100010];
vector<vector<int>> vec(100010);
vector<int> ans;
int co[100010] = {};
int out[100010];
int main() {
	int n, m;
	cin >> n >> m;
	for (int i = 0; i < n; i++) {
		cin >> a[i];
	}
	for (int i = 0; i < n - 1; i++) {
		if (i != n - 2) {
			if (a[i] == a[i + 2]) {
				cout << "No" << endl;
				return 0;
			}
		}
		if (a[i] == a[i + 1]) {
			cout << "No" << endl;
			return 0;
		}
	}
	for (int i = 0; i < n - 1; i++) {
		if (i % 2 == 0) {
			vec[a[i]].emplace_back(a[i + 1]);
			co[a[i + 1]]++;
		}
		else {
			vec[a[i + 1]].emplace_back(a[i]);
			co[a[i]]++;
		}
	}
	queue<int> que;
	for (int i = 1; i <= m; i++) {
		if (co[i] == 0) {
			que.push(i);
		}
	}
	while (!que.empty()) {
		int now = que.front();
		ans.emplace_back(now);
		for (int i = 0; i < vec[now].size(); i++) {
			co[vec[now][i]]--;
			if (co[vec[now][i]] == 0) {
				que.push(vec[now][i]);
			}
		}
		que.pop();
	}
	if (ans.size() != m) {
		cout << "No" << endl;
		return 0;
	}
	for (int i = 0; i < ans.size(); i++) {
		out[ans[i]] = i + 1;
	}
	cout << "Yes" << endl;
	for (int i = 1; i <= m; i++) {
		cout << out[i] << " ";
	}
	cout << endl;
}