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.HashMap;
import java.util.Map;
import java.util.Scanner;
import java.util.Set;

/**
 * @Author:chent17 Date: 2020/9/7 14:34
 */
public class Test0907 {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int n = sc.nextInt();   // 墙面
        int k = sc.nextInt();   // 颜料
        int[] walls = new int[n];   // 墙面编号
        int[] answer = new int[n];  // 方案
        for (int i = 0; i < n; i++) {
            walls[i] = sc.nextInt();
        }
        Map<Integer, Integer> map = new HashMap<>();    // 利用 HashMap 存储各编号墙面数量
        for (int str : walls) {
            Integer num = map.get(str);
            map.put(str, num == null ? 1 : num + 1);
        }
        Set<Map.Entry<Integer, Integer>> ms = map.entrySet();
        boolean flag = true;
        for (Map.Entry entry : ms) {    // 判断是否存在可行方案
            if ((int) entry.getValue() > k) {
                flag = false;
                System.out.println("NO");
                break;
            } else {
                continue;
            }
        }
        int color = 1;
        if (flag) {
            System.out.println("YES");
                for (Map.Entry entry : ms) {
                   for (int i = 0; i < walls.length; i++) {

                    if (walls[i] == (int) entry.getKey()) {
                        answer[i] = color++;
                        if(color>k)
                          color = 1;
                    }
                }
            }
            for (int i : answer) {
                System.out.print(i + " ");
            }
        }
    }
}
   		  	 					  		 	 			 	