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.*;
public class coloring{
 
   public static void main(String[] args) throws Exception {
      BufferedReader bf = new BufferedReader(new InputStreamReader(System.in));
      Scanner scan = new Scanner(System.in);
      PrintWriter out = new PrintWriter(new OutputStreamWriter(System.out));
      StringTokenizer st = new StringTokenizer(bf.readLine());
      int n = Integer.parseInt(st.nextToken());
      int k = Integer.parseInt(st.nextToken());
      st = new StringTokenizer(bf.readLine());
      int[] array = new int[n];
      int[] print = new int[n];
      int start=1;
      HashMap<Integer, Integer> map = new HashMap<Integer, Integer>();
      for(int i=0; i<n; i++){
         array[i] = Integer.parseInt(st.nextToken());
         print[i] = array[i];
      }
      Arrays.sort(print);
      int curr=array[0];
      map.put(print[0],1);
      int count=0;
      for(int i=0; i<n; i++){
         if(print[i]!=curr){
            map.put(print[i],i+1);
            curr=print[i];
         }
      }
      curr=array[0];
      for(int i=0; i<n; i++){
         if(print[i]!=curr){
            count=1;
            curr=print[i];
         }else
            count++;
         if(count>k){
            out.println("NO");
            out.close();
            System.exit(0);
         }
      }
      out.println("YES");
   
      for(int i=0; i<n; i++){
         if(map.get(array[i])%k==0){
            out.print(k + " ");
         }else
            out.print(map.get(array[i])%k+ " ");
       
         map.put(array[i],map.get(array[i])+1);
      }
      out.println("");
      out.close(); 
      
   }
  
}