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.

line1 = input()
num_list1 = [int(l) for l in line1.split()]
n = num_list1[0]
k = num_list1[1]
line2 = input()
num_list2 = [int(l) for l in line2.split()]
dict = {}
res = [1] * n
count = []
num_ = []
for key in num_list2:
    dict[key] = dict.get(key, 0) + 1
for i in dict:
    if dict[i] == 1:
        num_.append(i)
    count.append(dict[i])
if max(count) > k:
    print("NO")
else:
    print("YES")
    if len(set(num_list2)) == n:
        for j in range(k):
            res[j] = j+1
    else:
        temp = 1
        for i in dict:
            for j in range(dict[i]):
                res[num_list2.index(i)] = temp%k
                num_list2[num_list2.index(i)] = -1
                temp+=1
        # for j in range(n):
        #     if num_list2[j] in num_list2[:j]:
        #         res[j] = (res[num_list2[:j].index(num_list2[j])]+1)%k
            
        #         num_list2[num_list2[:j].index(num_list2[j])] = -1
        if max(res) < k:
            
            flag = max(res)+1
        else:
            flag = max(res)
        for j in range(n):
            
            if num_list2[j] in num_:
                res[j] = flag
                if flag < k:
                    flag += 1
            
    for r in res[:-1]:
        if r == 0:
            r = k
        print(r, end=" ") 
    if res[-1] == 0:
        res[-1] = k
    print(res[-1])
    
                
	 			 	 		  	 	    				 	   		