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

public class B {

    private final static Scanner sc = new Scanner(System.in);
    //private final static BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
    private final static StringBuilder sb = new StringBuilder();

    public static void main(String[] args) {

        int n = sc.nextInt();
        int k = sc.nextInt();
        int[] ns = new int[n];

        Map<Integer, Integer> m = new HashMap<>();
        Map<Integer, Set<Integer>> usedColors = new HashMap<>();

        for (int i = 0; i < n; i++) {
            int t = sc.nextInt();
            ns[i] = t;
            if(m.containsKey(t)){
                m.put(t, m.get(t) + 1);
            } else {
                m.put(t, 1);
                usedColors.put(t, new HashSet<>());
            }
        }
//
//        if(m.size() < k){
//            System.out.println("NO");
//            return;
//        }

        for (Map.Entry<Integer, Integer> e : m.entrySet()) {
            if(e.getValue() > k){
                System.out.println("NO");
                return;
            }
        }

        sb.append("YES\n");
        Set<Integer> used = new HashSet<>();

        int kk = 1;
        for(int t: ns){
            int temp = kk;
            while(usedColors.get(t).contains(temp)) {
                temp++;
                if(temp > k){
                    temp = 1;
                }
            }

            sb.append(temp).append(" ");

            used.add(temp);
            usedColors.get(t).add(temp);
            if(used.size() == k){
                used = new HashSet<>();
                kk = 1;
            }
            while(used.contains(kk) && kk<= k) kk++;
            if(kk > k) kk = 1;
        }
        sb.deleteCharAt(sb.length() - 1);
        sb.append('\n');

        System.out.print(sb.toString());
    }
}
