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.
//package codeforces;

import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.HashMap;
import java.util.HashSet;
import java.util.Map;
import java.util.Set;

public class B1102 {
    public static void main(String[] args) throws IOException {
        BufferedReader br = new BufferedReader(new InputStreamReader(System.in));

        String[] input = br.readLine().split(" ");
        int n = Integer.parseInt(input[0]);
        int k = Integer.parseInt(input[1]);

        input = br.readLine().split(" ");

        int[] items = new int[input.length];
        int[] freq = new int[5000 + 1];
        int maxFreq = Integer.MIN_VALUE;

        for (int i = 0; i < input.length; i++) {
            int a = Integer.parseInt(input[i]);
            freq[a]++;

            items[i] = a;
            maxFreq = Math.max(maxFreq, freq[a]);
        }

        if (maxFreq > k || n < k) {
            System.out.println("NO");
        } else {
            StringBuilder output = new StringBuilder();
            Map<Integer, Set<Integer>> usedColor = new HashMap<>();

            int j = 0;
            for (int item : items) {
                if (!usedColor.containsKey(item)) {
                    usedColor.put(item, new HashSet<>());
                }

                while (usedColor.get(item).contains((j % k) + 1)) {
                    j++;
                }

                output.append((j % k) + 1).append(" ");
                usedColor.get(item).add((j % k) + 1);

                j++;
            }

            System.out.println("YES");
            System.out.println(output.substring(0, output.length() - 1));
        }

    }
}
