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

public class Main {
    public static  void main(String args[]) {
        try{
          new Solve().start();
        }
        catch(Exception e)
        {
            System.out.println(e);
            System.exit(1);
        }
    }
}
class Solve
{
    void start()
    {
        run();
    }
    void run()
    {

       Scanner sc =new Scanner(System.in);
       int n =sc.nextInt();
       int k = sc.nextInt();
       int arr[][] =  new int[5007][5007];
       int index[] =new int [5007];
       for(int i =0 ; i <5007 ;i++)
           index[i]=0;
       int ans [] = new int [n+1];
       for(int i = 1 ; i <= n ; i++ )
       {
           int input;
           input = sc.nextInt();
           arr[input][index[input]]=i;
           index[input]++;
       }
       int k1=1;
       for(int  i=0; i<5004; i++)
       {
           if(index[i] > k)
           {
               System.out.println("NO");
               return;
           }
            for(int j=0;j < index[i];j++)
            {
                if(k1>k)
                    k1=1;
                ans[arr[i][j]]=k1;
                k1++;
            }
       }
        System.out.println("YES");
       for(int i =1;i<=n;i++)
           System.out.print(ans[i] + " ");

    }
}
  class Tools
{

}

