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.math.BigInteger;
import java.util.*;
import java.io.*;
import java.text.*;

public class Main {
    static BufferedReader br = new BufferedReader(new InputStreamReader(System.in), 32768);
    static PrintWriter out = new PrintWriter(System.out);
    static StringTokenizer t;

    static String sn() {
        while (t == null || !t.hasMoreTokens()) {
            try {
                t = new StringTokenizer(br.readLine());
            } catch (IOException e) {
                throw new RuntimeException();
            }
        }
        return t.nextToken();
    }

    static int ni() {
        return Integer.parseInt(sn());
    }

    static long nlo() {
        return Long.parseLong(sn());
    }

    public static void main(String args[]) {
        int t = 1;
        while (t-- > 0) {
            solve();
        }
        out.close();
    }

    static long mod = (long) 1e9 + 7;

    static long pro(long a, long b) {
        return (a % mod * b % mod) % mod;
    }

    static long add(long a, long b) {
        return (a + b) % mod;
    }

    static long sub(long a, long b) {
        return ((a % mod - b % mod) + mod) % mod;
    }

    static int maxn = 200005;

    static int pow(int n) {
        return (int) (Math.log10(n) / Math.log10(2));
    }

    static long modpow(long x, long y) {
        long res = 1l;
        x %= mod;
        while (y > 0) {
            if (y % 2 != 0)
                res = pro(res, x);
            x = pro(x, x);
            y /= 2;
        }
        return res;
    }

    static class pair {
        String a;
        int b;

        pair(String x, int y) {
            a = x;
            b = y;
        }
    }

    static long modInverse(long n) {
        BigInteger n1 = new BigInteger(Long.toString(n));
        String s = (n1.modInverse(new BigInteger(Long.toString(mod)))).toString();
        return Long.parseLong(s);
    }

    static boolean primecheck(long n) {
        for (int i = 2; i * i <= n; i++) {
            if (n % i == 0)
                return false;
        }
        return true;
    }

    static long gcd(long a, long b) {
        if (b == 0)
            return a;
        return gcd(b, a % b);
    }

    static void solve() {
//        int n = ni();
//        char c[] = sn().toCharArray();
//        int f[] = new int[125];
//        for (int i = 0; i < n; i++) {
//            f[c[i]]++;
//        }
//        int d = n / 3;
//        int need[] = new int[3];
//        int extra[] = new int[3];
//        need[0] = (d > f['0']) ? (d - f['0']) : 0;
//        need[1] = (d > f['1']) ? (d - f['1']) : 0;
//        need[2] = (d > f['2']) ? (d - f['2']) : 0;
//        extra[0] = (f['0'] > d) ? (-d + f['0']) : 0;
//        extra[1] = (f['1'] > d) ? (-d + f['1']) : 0;
//        extra[2] = (f['2'] > d) ? (-d + f['2']) : 0;
//        if (need[0] > 0) {
//            for (int i = 0; i < n && need[0] > 0; i++) {
//                if (c[i] != '0' && extra[c[i] - '0'] > 0) {
//                    need[0] -= 1;
//                    extra[c[i] - '0'] -= 1;
//                    c[i] = '0';
//                }
//            }
//        }
//        if (need[1] > 0) {
//            int cnt = 0;
//            for (int i = 0; i < n && need[1] > 0; i++) {
//                if (c[i] == '0') {
//                    if (extra[0] > 0 && cnt == d) {
//                        c[i] = '1';
//                        extra[0] -= 1;
//                        need[1] -= 1;
//                    }
//                    if (cnt < d)
//                        cnt++;
//                }
//            }
//        }
        int n = ni();
        int k = ni();
        int a[] = new int[n];
        int f[] = new int[5001];
        HashMap<Integer, List<Integer>> map = new HashMap<>();
        int max = 0;
        for (int i = 0; i < n; i++) {
            a[i] = ni();
            f[a[i]]++;
            max = Math.max(max, f[a[i]]);
            map.putIfAbsent(a[i], new ArrayList<>());
            map.get(a[i]).add(i);
        }
        if (k < max)
            out.println("NO");
        else {
            out.println("YES");
            int ans[] = new int[n];
            int p = 0;
            for (int h : map.keySet()) {
                for (int id : map.get(h)) {
                    ans[id] = p + 1;
                    p = (p + 1) % k;
                }
            }
            for (int h : ans)
                out.print(h + " ");
        }
    }
}
