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.*;

/**
 * @author: zhaoqing
 * @date: 2018/9/9
 * @time: 下午9:37
 */
public class ArrayKColoring {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int n = sc.nextInt();
        int k = sc.nextInt();
        List<String> result = new ArrayList<>();
        Map<Integer, List<Integer>> a = new HashMap<>();
        Boolean answer = true;
        int c=1;
        for (int i = 0; i < n; i++) {
            if(c>k){
                c=1;
            }
            int tmp = sc.nextInt();
            if (a.containsKey(tmp)) {
                List<Integer> cs = a.get(tmp);
                if(cs.size()==k){
                    answer = false;
                    break;
                } else {
                    if(cs.contains(c)){
                        for(int j=1;j<=k;j++){
                            if(!cs.contains(j)){
                                cs.add(j);
                                c=j;
                                break;
                            }
                        }
                        a.put(tmp,cs);
                    }else {
                        cs.add(c);
                        a.put(tmp,cs);
                    }
                    result.add(String.valueOf(c));
                }
            } else {
                List<Integer> cs=new ArrayList<>();
                cs.add(c);
                a.put(tmp, cs);
                result.add(String.valueOf(c));
            }
            c++;
        }
        if (answer) {
            System.out.println("YES");
            System.out.println(String.join(" ",result));
        } else {
            System.out.println("NO");
        }

    }
}
