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 int N = 5005;
const int M = 150;
const int INF = 0x3f3f3f3f;
const int MOD = 998244353;
int a[N], cnt[N], ans[N];
bool st[N][N], st1[N];
void solve() {
  int n, k;
  cin >> n >> k;
  for (int i = 0; i < n; i++) {
    cin >> a[i];
    cnt[a[i]]++;
  }
  int fg = 0;
  for (int i = 1; i <= 5000; i++)
    if (cnt[i] > k) fg = 1;
  if (fg)
    cout << "NO" << endl;
  else {
    map<int, int> mp;
    int idx = 1;
    for (int i = 0; i < n; i++) {
      if (!mp[a[i]] && idx <= k) {
        mp[a[i]]++;
        st[a[i]][idx] = true;
        st1[idx] = true;
        ans[i] = idx++;
      }
    }
    for (int i = 0; i < n; i++) {
      if (!ans[i]) {
        int idx = -1;
        for (int j = k; j >= 1; j--) {
          if (!st1[j]) {
            idx = j;
            break;
          }
        }
        if (idx == -1) idx = k;
        for (int j = idx; j >= 1; j--) {
          if (!st[a[i]][j]) {
            st[a[i]][j] = true;
            st1[j] = true;
            ans[i] = j;
            break;
          }
        }
      }
    }
    cout << "YES" << endl;
    for (int i = 0; i < n; i++) cout << ans[i] << ' ';
    cout << endl;
  }
}
int main() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  ;
  solve();
  return 0;
}
