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.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.lang.reflect.Array;
import java.util.*;

import static java.lang.Integer.parseInt;

/**
 * Created by Andrey on 31.12.2018.
 */
public class Stepic {
    static int scanInt() throws IOException {
        return parseInt(scanString());
    }


    static String scanString() throws IOException {
        while (tok == null || !tok.hasMoreTokens()) {
            tok = new StringTokenizer(in.readLine());
        }
        return tok.nextToken();
    }

    static BufferedReader in;
    static StringTokenizer tok;

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

        int n = scanInt();
        int k = scanInt();

        int[] arr = new int[n + 1];
        int[] color = new int[k + 1];
        int[] result = new int[n + 1];
        boolean flag = true;

        boolean[][] colors = new boolean[5001][5001];

        for (int i = 1; i <= n; ++i) {
            arr[i] = scanInt();
        }

        for (int i = 1; i <= k; ++i) {
            color[i] = i;
        }


        for (int i = 1; i <= k; ++i) {
            result[i] = color[i];
            colors[arr[i]][color[i]] = true;
        }


        if (n != k) {
            for (int i = k + 1; i <= n; ++i) {
                for (int j = 1; j <= k; ++j) {
                    if (!colors[arr[i]][color[j]]) {
                        result[i] = color[j];
                        colors[arr[i]][color[j]] = true;
                        break;
                    }
                }
                if (result[i] == 0) {
                    flag = false;
                }
            }

        }

        if (flag) {
            System.out.println("YES");
            for (int i = 1; i <= n; ++i) {
                System.out.print(result[i] + " ");
            }
        } else {
            System.out.println("NO");
        }
    }


}




