#include <iostream>
#include <vector>
#include <algorithm>
#include <cmath>
#include <queue>
#include <string>
#include <map>
#include <set>
#include <stack>
#include <tuple>
#include <deque>
#include <array>
#include <numeric>
#include <bitset>
#include <iomanip>
#include <cassert>
#include <chrono>
#include <random>
#include <limits>
#include <iterator>
#include <functional>
#include <sstream>
#include <fstream>
#include <complex>
#include <cstring>
#include <unordered_map>
#include <unordered_set>
using namespace std;

using ll = long long;
constexpr int INF = 1001001001;
constexpr int mod = 1000000007;
// constexpr int mod = 998244353;

template<class T>
inline bool chmax(T& x, T y){
    if(x < y){
        x = y;
        return true;
    }
    return false;
}
template<class T>
inline bool chmin(T& x, T y){
    if(x > y){
        x = y;
        return true;
    }
    return false;
}

int n, m;
int a[100005], ans[100005];
bool topological_sort(vector<vector<int>>& g){
    vector<int> indeg(m);
    for(int i = 0; i < m; ++i){
        for(int j : g[i])   indeg[j] += 1;
    }
    queue<int> que;
    for(int i = 0; i < m; ++i){
        if(indeg[i] == 0)   que.emplace(i);
    }
    vector<int> vs;
    while(!que.empty()){
        int u = que.front();
        que.pop();
        vs.emplace_back(u);
        for(int v : g[u]){
            if(--indeg[v] == 0) que.emplace(v);
        }
    }
    if(vs.size() != m)  return false;
    for(int i = 0; i < m; ++i){
        ans[vs[i]] = i + 1;
    }
    return true;
}

void output(){
    cout << "Yes\n";
    for(int i = 0; i < m; ++i){
        cout << ans[i] << (i == m - 1 ? '\n': ' ');
    }
}

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

    cin >> n >> m;
    for(int i = 0; i < n; ++i){
        cin >> a[i];
        --a[i];
    }
    for(int i = 0; i + 2 < n; ++i){
        if(a[i] == a[i + 1] || a[i + 1] == a[i + 2] || a[i + 2] == a[i]){
            cout << "No\n";
            return 0;
        }
    }

    vector<vector<int>> g(m);
    for(int i = 0; i < n; i += 2){
        if(i - 1 >= 0){
            g[a[i]].emplace_back(a[i - 1]);
        }
        if(i + 1 < n){
            g[a[i]].emplace_back(a[i + 1]);
        }
    }
    if(topological_sort(g)){
        output();
        return 0;
    }

    vector<vector<int>> g2(m);
    for(int i = 1; i < n; i += 2){
        g2[a[i]].emplace_back(a[i - 1]);
        if(i + 1 < n){
            g2[a[i]].emplace_back(a[i + 1]);
        }
    }
    if(topological_sort(g2))    output();
    else    cout << "No\n";

    return 0;
}