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;
vector<int> v;
string s;
map<long long, long long> mp;
long long a, b, c, d, t, tc, n, m, i, j, k, l, f, x, y, z;
long long ans, cnt, cnt1, cnt2, rlt, mn = LONG_LONG_MAX, mx = LONG_LONG_MIN;
bool ff[100100] = {false};
struct stk {
  int x, pos, y;
};
bool comp1(stk a, stk b) { return a.x < b.x; }
bool comp2(stk a, stk b) { return a.pos < b.pos; }
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  cout.tie(NULL);
  stk ara[100000];
  cin >> n >> k;
  for (i = 0; i < n; i++) {
    cin >> ara[i].x;
    ara[i].pos = i;
    mp[ara[i].x]++;
    if (mp[ara[i].x] > k) {
      f = 1;
    }
  }
  if (f == 0) {
    cout << "YES" << endl;
    sort(ara, ara + n, comp1);
    j = 1;
    for (i = 0; i < n; i++) {
      if (j > k) j = 1;
      ara[i].y = j;
      j++;
    }
    sort(ara, ara + n, comp2);
    for (i = 0; i < n; i++) {
      cout << ara[i].y << " ";
    }
  } else {
    cout << "NO" << endl;
  }
rett:
  return 0;
}
