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 = [int(x) for x in input().split()]
arr = [int(x) for x in input().split()]


cd = {}
for i in range(n):
	if arr[i] in cd:
		cd[arr[i]]+=1
	else:
		cd[arr[i]] = 1

if k>n:
	print("NO")
	exit()
else:
	for i in cd.keys():
		if cd[i]>k:
			print("NO")
			exit()

### CASES OF NO  ###

# if k>n
# if count of a digit in the array is > k then it cant be colored

### HOW TO MAKE YES ###

# Sort the array
# Take the part of same digits 
# Start replacing from 1 to K
# Repeat for other parts
# Again sort the array
ad = []
for i in range(n):
	ad.append([arr[i],i])
ad.sort()

#print(ad)
i = 0
rep = 1
while i < n:
	j = cd[ad[i][0]]
	ja = j
	while j>0:
		ad[i+ja-j][0] = rep
#		print(ad)
		rep=rep+1
		if rep>k:
			rep = 1
		j-=1
	i+=ja

ad.sort(key=lambda x: x[1])
print("YES")
for i in range(n):
	print(ad[i][0],end=" ")

