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

def main():
    N,k = [ int(x) for x in stdin.readline().strip().split(" ")]
    arr = [ int(x) for x in stdin.readline().strip().split(" ")]

    countNumbers = {}
    for n in arr:
        if n in countNumbers:
            countNumbers[n]= countNumbers[n] + 1
        else:
            countNumbers[n] =  1

 
    res = [-1 for x in arr]
    isValid = True
    for key in countNumbers:
        if countNumbers[key] > k:
            isValid = False
    if(not isValid):
        print("NO")
    else:
        
        filledNumbers = 0
        colorsDict = {}
        for a in range(1, k +1): colorsDict[a] = {}
        color = 1
        n = 0
        while color != k+1:
            if res[n] == -1 and  not arr[n] in colorsDict[color]:
                colorsDict[color][arr[n]]=1
                res[n] = color
                #next color
                color += 1
            n = (n+1)%N
        for i in range(0, len(arr)):
            if res[i] == -1:
                res[i] = findColor(arr[i], colorsDict)
                
        print("YES")
        print(' '.join(str(e) for e in res))

def findColor(e, colors):
    for color in colors:
        if not e in colors[color]:
            colors[color][e] = 1
            return color
    return -3
main()

'''
4 2
1 2 2 3
outputCopy
YES
1 1 2 2
inputCopy
5 2
3 2 1 2 3
outputCopy
YES
2 1 1 2 1
inputCopy
5 2
2 1 1 2 1'''