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.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.*;

public class Week5HashMap {
    public static void main(String[] args) throws IOException {
        BufferedReader sc = new BufferedReader(new InputStreamReader(System.in));
        String[] s = sc.readLine().split(" ");
        int wallNumber = Integer.parseInt(s[0]);
        int colorNumber = Integer.parseInt(s[1]);
        String[] wall = sc.readLine().split(" ");
        int[] wallNo = new int[wallNumber];
        for (int i = 0; i < wallNumber; i++) {
            wallNo[i] = Integer.parseInt(wall[i]);
        }
        result(wallNo,colorNumber,wallNumber);
    }
    private static void result(int[] wallNo, int colorNumber, int wallNumber) {
        if(wallNumber == 1){
            System.out.println("YES");
            System.out.println(1);
            return;
        }
        if(wallNumber == colorNumber){
            System.out.println("YES");
            for (int i = 1; i <= wallNumber; i++) {
                System.out.print(i+" ");
            }
            return;
        }
        int[] colorFunction = new int[wallNumber];
        int temp = 1;
        int count = 0;
//        HashSet<Integer> set;
        Map<Integer, HashSet<Integer>> wall = new HashMap<>();
        for (int i = 0; i < colorNumber; i++) {
            if(wall.containsKey(wallNo[i])){
                HashSet<Integer> set = wall.get(wallNo[i]);
                set.add(temp);
                wall.put(wallNo[i],set);
                colorFunction[i] = temp;
                temp ++;
            }
            else{
                HashSet<Integer> set = new HashSet<>();
                set.add(temp);
                wall.put(wallNo[i],set);
                colorFunction[i] = temp;
                temp ++;
            }

        }
        for (int i = colorNumber; i < wallNumber; i++) {
            if(wall.containsKey(wallNo[i])){
                HashSet<Integer> set = wall.get(wallNo[i]);
                int j = 1;
                while(set.contains(j) && j<=colorNumber){
                    j++;
                }
                if(j>colorNumber){
                    System.out.println("NO");
                    return;
                }
                if(!set.contains(j)) {
                    set.add(j);
                    wall.put(wallNo[i], set);
                    colorFunction[i] = j;
//                    System.out.println(set.toArray());
                }
            }
            else{
                HashSet<Integer> set = new HashSet<>();
                set.add(1);
                wall.put(wallNo[i],set);
                colorFunction[i] = 1;
            }

        }
        System.out.println("YES");
        for (int i = 0; i < wallNumber; i++) {
            System.out.print(colorFunction[i]+" ");
        }
    }
//    private static void result(int[] wallNo, int colorNumber, int wallNumber) {
//        if(wallNumber == 1){
//            System.out.println("YES");
//            System.out.println(1);
//            return;
//        }
//        if(wallNumber == colorNumber){
//            System.out.println("YES");
//            for (int i = 1; i <= wallNumber; i++) {
//                System.out.print(i+" ");
//            }
//            return;
//        }
//        int[] colorFunction = new int[wallNumber];
//        int[] colorNO = new int[wallNumber];
//        int temp = 1;
//        int count=0;
//        Map<Integer,Integer> wall = new HashMap<>();
//        for (int i = 0; i < wallNumber; i++) {
//            if(wall.containsKey(wallNo[i])){
//                colorFunction[i] = (wall.get(wallNo[i]) + 1)%colorNumber;
//                colorNO[i] = wall.get(wallNo[i]) + 1;
//                if(colorNO[i] > colorNumber){
//                    System.out.println("NO");
//                    return;
//                }
//                wall.put(wallNo[i],colorFunction[i]);
//            }
//            else{
//                wall.put(wallNo[i],temp);
//                colorFunction[i] = temp;
//                temp++;
//            }
//        }
//        System.out.println("YES");
//        for (int i = 0; i < wallNumber; i++) {
//            System.out.print(colorFunction[i]+" ");
//        }
//    }
}

	 	     			  	    				  				 		