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>
bool notInList(int num, int outp[], int len) {
  for (int i = 0; i < len; i++)
    if (outp[i] == num) return false;
  return true;
}
void replaceDuplicateTo(int num, int arr[], int len, int range) {
  int check[range + 1];
  for (int i = 0; i <= range; i++) check[i] = 0;
  for (int i = 0; i < len; i++)
    if (check[arr[i]] == 0)
      check[arr[i]] = 1;
    else {
      arr[i] = num;
      return;
    }
}
int main() {
  int n, k, i;
  scanf("%d %d", &n, &k);
  int flag[5001];
  for (i = 1; i <= 5000; i++) flag[i] = 0;
  int arr[n];
  int output[n];
  for (i = 0; i < n; i++) {
    scanf("%d", &arr[i]);
    int temp = arr[i];
    flag[temp]++;
  }
  int check = 0;
  for (i = 1; i <= 5000; i++) {
    if (flag[i] > k) {
      check = 1;
      break;
    }
  }
  if (check == 1)
    printf("NO\n");
  else {
    printf("YES\n");
    int temp = 0;
    for (i = 1; i <= 5000; i++) flag[i] = (temp++) % k;
    for (i = 0; i < n; i++) output[i] = 1 + (flag[arr[i]]++) % k;
    for (i = 1; i <= k; i++)
      if (notInList(i, output, n)) replaceDuplicateTo(i, output, n, k);
    for (i = 0; i < n; i++) printf("%d ", output[i]);
    printf("\n");
  }
  return 0;
}
