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.OutputStream;
import java.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.util.List;
import java.util.Arrays;
import java.util.Map;
import java.util.Scanner;
import java.util.HashMap;
import java.util.Comparator;
import java.util.ArrayList;

/**
 * Built using CHelper plug-in
 * Actual solution is at the top
 */
public class Main {
    public static void main(String[] args) {
        InputStream inputStream = System.in;
        OutputStream outputStream = System.out;
        Scanner in = new Scanner(inputStream);
        PrintWriter out = new PrintWriter(outputStream);
        TaskB solver = new TaskB();
        solver.solve(1, in, out);
        out.close();
    }

    static class TaskB {
        public void solve(int testNumber, Scanner in, PrintWriter out) {
            int n = in.nextInt();
            int k = in.nextInt();
            E[] es = new E[n];
            Map<Integer, List<Integer>> mp = new HashMap<Integer, List<Integer>>();
            for (int i = 0; i < n; i++) {
                int v = in.nextInt();
                es[i] = new E(v, i);
            }
            int[] res = new int[n];
            Arrays.sort(es, new Comparator<E>() {

                public int compare(E o1, E o2) {
                    return o1.val - o2.val;
                }
            });
            int cur_color = 1;
            for (int i = 0; i < n; i++) {
                int idx = es[i].idx;
                int v = es[i].val;
                List<Integer> l = null;
                if (!mp.containsKey(v))
                    l = new ArrayList<Integer>();
                else
                    l = mp.get(v);
                l.add(idx);
                mp.put(v, l);
            }
            for (int v : mp.keySet()) {
                List<Integer> idx_l = mp.get(v);
                if (idx_l.size() > k) {
                    out.println("NO");
                    return;
                }
                for (int idx : idx_l) {
                    res[idx] = (cur_color) % k + 1;
                    cur_color++;
                }
            }
            if (cur_color < k) {
                out.println("NO");
                return;
            }
            out.println("YES");
            for (int i = 0; i < n; i++) {
                out.print(res[i]);
                if (i < n - 1) out.print(" ");
            }
            out.println();
        }

        class E {
            int val;
            int idx;

            public E(int val, int idx) {
                this.val = val;
                this.idx = idx;
            }

        }

    }
}

