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.
import sys


h={}
def printTheArray(l,colr,n):
	# print(colr)
	newa=[0]*n
	for i in xrange(len(l)):
		c=0
		for j in h[l[i][0]]:
			newa[j]=colr[i][c]
			c+=1
	return(newa)

		

n,k=map(int,raw_input().split())
a=list(map(int,raw_input().split()))

for i in xrange(len(a)):
	if a[i] not in h:
		h[a[i]]=[i]
	else:
		h[a[i]].append(i)
a.sort()
l=[[a[0]]]
colr=[]
j=1
while j<len(a):
	if(a[j]==l[-1][-1]):
		l[-1].append(a[j])
	else:
		l.append([a[j]])
	j+=1
c=1
maxc=0
for i in xrange(len(l)):
	col=[]
	if len(l[i])>k:
		maxc=-1
		break
	for j in xrange(len(l[i])):
		if c>maxc:
			maxc=c
		col.append(c)
		c+=1
		if c>k:
			c=1
	colr.append(col)
# print(l)
# print(colr)
# print(maxc)
if maxc<k:
	print("NO")
else:
	print("YES")
	thearray=printTheArray(l,colr,n)
	print(' '.join(map(str, thearray)))
