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.
from collections import defaultdict as dfd

n, k  = map(int, input().split())
arr = list(map(int, input().split()))
d = dfd(int)
for i in arr:
    d[i] += 1

if k>n:
    print("NO")
elif k==n:
    print("YES")
    print(*[i for i in range(1, len(arr)+1)])
else:
    flag = 0
    for i in d.values():
        if i>k:
            flag = 1
            print("NO")
            break

    brr = [0]*len(arr)
    element_covered = 0
    mx = 0
    fg = 0
    if flag==0:
        for i in d.keys():
            fd = 1
            for j in range(len(arr)):
                if arr[j]==i:
                    brr[j] = fd
                    element_covered += 1
                    mx = max(mx, fd)
                    
                    if len(arr)-element_covered<=k-mx:
                        #print(k, mx, element_covered)
                        #print(*brr)
                        fg = 1
                        break
                    
                    fd += 1
            if fg==1:
                #print("mx==", mx)
                break
        if fg==1:
            #print("mx==", mx)
            for i in d.keys():
                for j in range(len(arr)):
                    if brr[j]==0:
                        if arr[j]==i:
                            brr[j] = mx + 1
                            mx += 1
                #print(*brr)
        print("YES")
        print(*brr)



##n = int(input())
##n %= 4
##if n==1 or n==2:
##    print(1)
##else:
##    print(0)
