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 java.io.*;
import java.util.HashMap;
import java.util.*;

public class icpc
{
    public static void main(String[] args)throws IOException
    {
        BufferedReader in = new BufferedReader(new InputStreamReader(System.in));
        String s[] = in.readLine().split(" ");
        int n = Integer.parseInt(s[0]);
        int k = Integer.parseInt(s[1]);
        String A[] =  in.readLine().split(" ") ;
        System.out.println(new Solver().solve(A,k));
    }
}
class Solver
{
    public StringBuilder solve(String[] B,int k)
    {
        int[] A = new int[B.length];
        for(int i=0;i<B.length;i++)
            A[i] = Integer.parseInt(B[i]);
        HashMap<Integer,Integer> h = new HashMap<>();
        int max_freq = 0;
        for(int i=0;i<A.length;i++)
        {
            if(h.containsKey(A[i]))
                h.put(A[i],h.get(A[i])+1);
            else
                h.put(A[i],1);
            if(h.get(A[i])>max_freq)
            {
                max_freq = h.get(A[i]);
            }
        }
        StringBuilder stringbuilder = new StringBuilder();
        if(k<max_freq)
        {
            stringbuilder.append("NO").append("\n");
            return stringbuilder;
        }
        else
        {
            stringbuilder.append("YES").append("\n");
        }
        if(k > max_freq)
        {
            int color = k;
            Iterator iter = h.entrySet().iterator();
            while (iter.hasNext())
            {
                Map.Entry mapElement = (Map.Entry)iter.next();
                if(color > (int)mapElement.getValue())
                {
                    int dec = (int)mapElement.getValue();
                    h.put((int)mapElement.getKey(),color);
                    color -= dec;
                }
                else
                {
                    break;
                }
            }
        }
        int[] C = new int[A.length];
        for(int i=0;i<A.length;i++)
        {
            C[i] = h.get(A[i]);
            h.put(A[i],h.get(A[i])-1);
        }
        for(int i=0;i<C.length;i++)
        {
            stringbuilder.append(C[i]+" ");
        }
        return stringbuilder;
    }
}
