You are given an array a consisting of n integer numbers.

You have to color this array in k colors in such a way that: 

  * Each element of the array should be colored in some color; 
  * For each i from 1 to k there should be at least one element colored in the i-th color in the array; 
  * For each i from 1 to k all elements colored in the i-th color should be distinct. 



Obviously, such coloring might be impossible. In this case, print "NO". Otherwise print "YES" and any coloring (i.e. numbers c_1, c_2, ... c_n, where 1 ≤ c_i ≤ k and c_i is the color of the i-th element of the given array) satisfying the conditions above. If there are multiple answers, you can print any.

Input

The first line of the input contains two integers n and k (1 ≤ k ≤ n ≤ 5000) — the length of the array a and the number of colors, respectively.

The second line of the input contains n integers a_1, a_2, ..., a_n (1 ≤ a_i ≤ 5000) — elements of the array a.

Output

If there is no answer, print "NO". Otherwise print "YES" and any coloring (i.e. numbers c_1, c_2, ... c_n, where 1 ≤ c_i ≤ k and c_i is the color of the i-th element of the given array) satisfying the conditions described in the problem statement. If there are multiple answers, you can print any.

Examples

Input


4 2
1 2 2 3


Output


YES
1 1 2 2


Input


5 2
3 2 1 2 3


Output


YES
2 1 1 2 1


Input


5 2
2 1 1 2 1


Output


NO

Note

In the first example the answer 2~ 1~ 2~ 1 is also acceptable.

In the second example the answer 1~ 1~ 1~ 2~ 2 is also acceptable.

There exist other acceptable answers for both examples.
#include <bits/stdc++.h>
using namespace std;
long long int choose(long long int n, long long int m) {
  long long int ans = 0;
  long long int num = 1;
  long long int den = 1;
  for (long long int i = 0; i < m; i++) {
    num *= (n - i);
    num = num / (i + 1);
  }
  return num;
}
bool isPrime(int n) {
  if (n <= 1) return false;
  if (n <= 3) return true;
  if (n % 2 == 0 || n % 3 == 0) return false;
  for (int i = 5; i * i <= n; i = i + 6) {
    if (n % i == 0 || n % (i + 2) == 0) return false;
  }
  return true;
}
long long int gcd(long long int a, long long int b) {
  if (a == 0) {
    return b;
  } else {
    return gcd(b % a, a);
  }
}
bool sortDes(long long int i, long long int j) { return i > j; }
long long int bits(long long int n) {
  long long int count = 0;
  while (n != 0) {
    if (n % 2 != 0)
      count++;
    else
      ;
    n /= 2;
  }
  return count;
}
int main() {
  long long int i, j, k, n, m, q, l, r, d;
  cin >> n >> k;
  vector<pair<long long int, long long int> > a(n);
  map<long long int, long long int> e;
  vector<long long int> v(n);
  d = 1;
  for (i = 0; i < n; i++) {
    cin >> a[i].first;
    a[i].second = i;
    e[a[i].first]++;
  }
  for (i = 0; i < n; i++) {
    if (e[a[i].first] > k) {
      cout << "NO\n";
      return 0;
    }
  }
  if (k > n) {
    cout << "NO\n";
    return 0;
  }
  cout << "YES\n";
  sort(a.begin(), a.end());
  long long int prev = -1;
  for (i = 0; i < n; i++) {
    if (prev == -1) {
      prev = a[i].first;
      v[a[i].second] = 1;
      d = 1;
    } else {
      if (prev == a[i].first) {
        d++;
        if (d > k) {
          v[a[i].second] = 1;
          d = 1;
          prev = a[i].first;
        } else {
          v[a[i].second] = d;
          prev = a[i].first;
        }
      } else {
        d++;
        if (d > k) {
          d = 1;
        }
        v[a[i].second] = d;
        prev = a[i].first;
      }
    }
  }
  for (i = 0; i < n; i++) {
    cout << v[i] << " ";
  }
  cout << endl;
  return 0;
}
