#include <bits/stdc++.h>
using namespace std;
bool visit[2010][2010] = {};
vector<long long> vec[100001];
long long b[100001] = {};
struct s {
  long long s1, s2;
} a[10000];
bool srt(const s &lhs, const s &rhs) {
  if (lhs.s1 < rhs.s1)
    return true;
  else
    return false;
}
int main() {
  ios::sync_with_stdio(false);
  long long n, m, x, k;
  cin >> n >> k;
  map<long long, long long> mp;
  map<long long, long long> mlp;
  bool f = 0;
  for (int i = 0; i < n; i++) {
    cin >> a[i].s1;
    a[i].s2 = i;
    mlp[i] = 0;
    if (mp.find(a[i].s1) == mp.end()) {
      mp[a[i].s1] = 1;
    } else {
      mp[a[i].s1]++;
    }
    if (mp[a[i].s1] > k) {
      f = 1;
    }
  }
  if (f == 1 || n < k) {
    cout << "NO\n";
    return 0;
  }
  int r = 1;
  stable_sort(a, a + n, srt);
  cout << "YES\n";
  for (int i = 0; i < n; i++) {
    for (int j = i; j < n; j++) {
      if (a[j].s1 == a[i].s1 && mlp[i] == 0) {
        mlp[i] = 1;
        b[a[i].s2] = r;
        r++;
        if (r > k) r = 1;
      }
    }
  }
  for (int i = 0; i < n; i++) {
    cout << b[i] << " ";
  }
}
