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.*;
import java.util.*;

public class Main {


    public static void main(String[] args) {
        InputReader in = new InputReader(System.in);
        PrintStream out = System.out;
        TaskB taskB = new TaskB();

//        out.println("YES");
        taskB.solve(in, out);

    }

    static class TaskB {
        void solve(InputReader in, PrintStream out) {
            int n = in.nextInt();
            int k = in.nextInt();
            int[] colors = new int[n];
            int[] ar = new int[n];
            Map<Integer, List<Integer>> map = new HashMap<>();
            for (int i = 0; i < n; i++) {
                int val = in.nextInt();
                ar[i] = val;
                if (!map.containsKey(val)) {
                    map.put(val, new ArrayList<>());
                }
                map.get(val).add(i);
            }
            int maxLen = -1;
            for (Map.Entry<Integer, List<Integer>> e : map.entrySet()) {
                maxLen = Math.max(maxLen, e.getValue().size());
            }
            if (maxLen > k) {
                out.println("NO");
                return;
            }

            Map<Integer, Integer> colorCounts = new HashMap<>();
            for (int i = 0; i < maxLen; i++) {
                int count = 0;
                for (Integer key : map.keySet()) {
                    List<Integer> indices = map.get(key);
                    if (i >= indices.size()) continue;
                    colors[indices.get(i)] = i+1;
                    count++;
                }
                colorCounts.put(i+1, count);
            }

            int i = 0;
            for (int j = maxLen; j < k; j++) {
                while (colorCounts.get(colors[i]) == 1) i++;
                colorCounts.put(colors[i], colorCounts.get(colors[i]) - 1);
                colors[i++] = j+1;
            }

            out.println("YES");
            for (int j = 0; j < n; j++) out.print(colors[j] + " ");
        }
    }

    static class InputReader {
        private BufferedReader reader;
        private StringTokenizer tokenizer;

        public InputReader(InputStream stream) {
            reader = new BufferedReader(new InputStreamReader(stream), 32768);
            tokenizer = null;
        }

        String next() {
            while (tokenizer == null || !tokenizer.hasMoreTokens()) {
                try {
                    tokenizer = new StringTokenizer(reader.readLine());
                } catch (IOException e) {
                    throw new RuntimeException(e);
                }
            }
            return tokenizer.nextToken();
        }

        int nextInt() {
            return Integer.parseInt(next());
        }

    }
}
