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.
n, k = map(int, input().split(' '))
a = list(map(int, input().split(' ')))

t = [0]*5001

t2 = 0

t3 = [0]*(k+1)

ans = [0]*n
max = 0
for i in range(n):
    if t[a[i]] < k:
        t[a[i]] += 1
        ans[i] = t[a[i]]
        t3[t[a[i]]] += 1
        if max < t[a[i]]:
            max = t[a[i]]
    else:
        t2 = 1
        break

if t2 == 0:
    i = 1
    while(i < k+1):
        if max == k:
            break
        elif t3[i] > 1 and max < k:
            max += 1
            t3[i] -= 1
            t4 = ans.index(i)
            ans[t4] = max
            t3[max] += 1
        elif t3[i] == 1:
            i += 1
    print('YES')
    print(*ans, sep = ' ')
else:
    print('NO')