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 MAX_N = 1e5 + 1;
const int MOD = 1e9 + 7;
const int INF = 1e9;
const long long int LINF = 1e18;
bool sortbysec(const pair<int, int> &a, const pair<int, int> &b) {
  return (a.second < b.second);
}
void solve() {
  long long int n, m;
  cin >> n >> m;
  vector<pair<long long int, long long int>> a;
  for (int i = 0; i < n; i++) {
    int x;
    cin >> x;
    a.push_back(make_pair(x, i + 1));
  }
  sort(a.begin(), a.end());
  long long int start{1}, end{1};
  vector<pair<long long int, long long int>> b;
  for (int i = 0; i < n; i++) {
    b.push_back(make_pair(0, a[i].second));
  }
  int flag = 0;
  int count = 0;
  b[0].first = 1;
  for (int i = 1; i < n; i++) {
    if (a[i].first == a[i - 1].first) {
      end++;
      if (end == m + 1) {
        end = 1;
        count++;
      }
      if (start == end) {
        cout << "NO" << endl;
        return;
      }
      b[i].first = end;
    } else {
      end++;
      if (end == m + 1) {
        end = 1;
        count++;
      }
      start = end;
      b[i].first = end;
    }
    if (start == m + 1) {
      start = 1;
      count++;
    }
    if (end == m + 1) {
      end = 1;
      count++;
    }
  }
  sort(b.begin(), b.end(), sortbysec);
  if ((count != 0) || (end == m)) {
    cout << "YES" << endl;
    for (int i = 0; i < n; i++) {
      cout << b[i].first << " ";
    }
    cout << endl;
  } else {
    cout << "NO" << endl;
  }
}
int main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  solve();
}
