#include <bits/stdc++.h>
using namespace std;
int main() {
  ios_base::sync_with_stdio(0);
  cin.tie(NULL);
  cout.tie(NULL);
  long long int n, k;
  cin >> n >> k;
  long long int arr[n], ans[n];
  for (long long int i = 0; i < n; i++) cin >> arr[i];
  set<long long int> colors[k + 1];
  set<long long int> marked;
  set<pair<long long int, long long int> > coor_col[k + 1];
  for (long long int i = 1; i <= k; i++) marked.insert(i);
  for (long long int i = 0; i < n; i++) {
    bool flag = 1;
    for (long long int j = 1; j <= k; j++) {
      if (colors[j].find(arr[i]) == colors[j].end()) {
        flag = 0;
        colors[j].insert(arr[i]);
        coor_col[j].insert(make_pair(arr[i], i));
        ans[i] = j;
        marked.erase(j);
        break;
      }
    }
    if (flag) {
      cout << "NO\n";
      return 0;
    }
  }
  for (auto it : marked) {
    int co = 0;
    for (long long int i = 1; i <= k; i++) {
      if (coor_col[i].size() > 1) {
        set<pair<long long int, long long int> > temp;
        bool flag = 0;
        while (!coor_col[i].empty()) {
          pair<long long int, long long int> x = (*coor_col[i].begin());
          coor_col[i].erase(x);
          colors[i].erase(x.first);
          if (colors[it].find(x.first) == colors[it].end()) {
            ans[x.second] = it;
            coor_col[it].insert(x);
            colors[it].insert(x.first);
            co = 1;
            flag = 1;
            break;
          } else {
            temp.insert(x);
            colors[i].insert(x.first);
          }
        }
        for (auto it : temp) coor_col[i].insert(it);
        if (flag) break;
      }
    }
    if (!co) {
      cout << "NO\n";
      return 0;
    }
  }
  cout << "YES\n";
  for (long long int i = 0; i < n; i++) cout << ans[i] << " ";
  cout << endl;
  return 0;
}
