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;
const double EPS = 1e-8;
int dcmp(double a, double b) { return fabs(a - b) <= EPS ? 0 : a < b ? -1 : 1; }
void debug() {
  freopen("input.in", "r", stdin);
  freopen("output.in", "w", stdout);
}
bool arr[5001][5001] = {};
bool colours[5001] = {};
int inp[5001];
int main() {
  cout << fixed << setprecision(0);
  ios::sync_with_stdio(false), cin.tie(nullptr), cout.tie(nullptr);
  int n, a, m;
  bool done = true, found = false;
  cin >> n >> a;
  for (int i = 0; i < n && done; ++i) {
    cin >> m;
    found = false;
    for (int j = 0; j < a; ++j) {
      if (!arr[m][j] && !colours[j]) {
        arr[m][j] = 1;
        colours[j] = 1;
        inp[i] = j + 1;
        found = true;
        break;
      }
    }
    for (int j = 0; j < a && !found; ++j) {
      if (!arr[m][j]) {
        arr[m][j] = 1;
        colours[j] = 1;
        inp[i] = j + 1;
        found = true;
        break;
      }
    }
    if (!found) {
      done = false;
      break;
    }
  }
  if (!done) {
    cout << "NO";
  } else {
    cout << "YES\n";
    for (int i = 0; i < n; ++i) {
      cout << inp[i] << " ";
    }
  }
}
