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

import static java.lang.Math.*;

public class Main {
    FastScanner in;
    PrintWriter out;

    void run() {
        in = new FastScanner();
        out = new PrintWriter(System.out);
        problem();
        out.close();
    }

    class FastScanner {
        BufferedReader br;
        StringTokenizer st;

        public FastScanner() {
            br = new BufferedReader(new InputStreamReader(System.in));
        }

        public FastScanner(String s) {
            try {
                br = new BufferedReader(new FileReader(s));
            } catch (FileNotFoundException e) {
                e.printStackTrace();
            }
        }

        public String nextToken() {
            while (st == null || !st.hasMoreTokens()) {
                try {
                    st = new StringTokenizer(br.readLine());
                } catch (IOException e) {
                }
            }
            return st.nextToken();
        }

        public int nextInt() {
            return Integer.parseInt(nextToken());
        }

        public long nextLong() {
            return Long.parseLong(nextToken());
        }

        public double nextDouble() {
            return Double.parseDouble(nextToken());
        }
    }

    public static void main(String[] args) {
        new Main().run();
    }

    public static long modPower(int x, int y) {
        if (y == 0) return 1;
        long z = modPower(x, y / 2);
        if ((y % 2) == 0)
            return (z * z) % N;
        else
            return (x * z * z) % N;
    }

    static long modFact(int n) {
        int result = 1;
        for (int i = 1; i <= n; i++) {
            result = (result * i) % N;
        }
        return result;
    }

    //static int N = 998244353;
    static int N = (int) pow(10, 9) + 7;

    class Pair {
        int id;
        int v;
        int c;

        public Pair(int v, int c, int id) {
            this.v = v;
            this.c = c;
            this.id = id;
        }
    }

    void problem() {
        int n = in.nextInt();
        int k = in.nextInt();
        Pair[] a = new Pair[n];
        int[] c = new int[n];

        int kk = 0;
        int cur = 0;
        for (int i = 0; i < n; i++) {
            a[i] = new Pair(in.nextInt(), i, 0);
        }

        Arrays.sort(a, Comparator.comparingInt( p -> p.v));

        for (int i = 0; i < n; i++) {
            if (i == 0 || a[i].v == a[i - 1].v) {
                kk++;
            } else {
                kk = 1;
            }
            if (kk <= k) {
                c[a[i].c] = cur + 1;
                cur = (cur + 1) % k;
            } else {
                out.println("NO");
                return;
            }
        }
        out.println("YES");
        for (int i = 0; i < n; i++) {
            out.print(c[i] + " ");
        }

    }
}