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.
x,y=map(int,raw_input().split())
m={}
f=[]
for i in range(0,5010):
	f.append(0)
a=map(int,raw_input().split())

b=sorted(a)
x1=[]
count=1
for i in b:
	#print "NO"
	x1.append((count-1)%y+1)
	count=count+1
for j in range(1,y+1):
	if j not in x1:
		print "NO"
		exit()					
m={}
for i in a:
	if i in m:
		m[i]=m[i]+1
		if(m[i]>y):
			print "NO"
			exit()
	else:
		m[i]=1
m={}
for i in range(len(b)):
	if b[i] not in m:
		m[b[i]]=[x1[i]]
	else:
		m[b[i]].append(x1[i])
print "YES"
for j in a:
	print m[j][f[j]],
	f[j]=f[j]+1

print ""