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.BigInteger;
        import java.util.*;
        import java.io.BufferedReader;
        import java.io.IOException;
        import java.io.InputStreamReader;
    
    
        public class main2 {


            static  class pair implements Comparable<pair> {
                int x , y ;
                pair(int x , int y){
                    this.x = x ;
                    this.y = y ;
                }


                @Override
                public int compareTo(pair o) {
                    return this.x - o.x ;
                }
            }


    
            public static void main(String[] args) {
                try {
    
    
                    PrintWriter fop = new PrintWriter(System.out);
                    FastScanner fsca = new FastScanner();

                    long n=fsca.nextLong(),k=fsca.nextLong(),cur=0,flag=0,j=0,ans[]=new long[(int)n],cnt=0;
                    pair a[]=new pair[(int)n];
                    for(int i=0;i<n;i++){a[i]=new pair(fsca.nextInt(),i);}
                    Arrays.sort(a);
                    for(int i=0;i<n;i++){
                        if(i!=0 && a[i].x!=a[i-1].x){
                            cnt=0;
                        }
                        cnt++;
                        if(cnt>k){flag=1;break;}
                        ans[a[i].y]=cur%k+1;
                        cur++;
                    }
                    if(flag==1){
                        fop.println("NO");
                    }
                    else {
                        fop.println("YES");
                        for (long i : ans) fop.print(i + " ");


                    }















                    fop.flush();
                    fop.close();
                } catch (Exception e) {
                    return;
                }
    
    
            }
            /*-----------------------------------------------------------------------------------------------------------------------------------------------*/
    
    
            static void sieve(int n) {
                boolean[] flag = new boolean[n];
    
                for (int i = 2; i * i < n; i++) {
                    if (flag[i])
                        continue;
                    else
                        for (int j = i * i; j <= n; j += i) {
                            flag[j] = true;
                        }
                }
            }
    
    
            static int gcd(int a, int b) {
                if (b > a) {
                    int tenp = b;
                    b = a;
                    a = tenp;
                }
                int temp = 0;
                while (b != 0) {
                    a %= b;
                    temp = b;
                    b = a;
                    a = temp;
                }
                return a;
            }
    
            static long gcd_long(long a, long b) {
                if (b > a) {
                    long tenp = b;
                    b = a;
                    a = tenp;
                }
                long temp = 0;
                while (b != 0) {
                    a %= b;
                    temp = b;
                    b = a;
                    a = temp;
                }
                return a;
            }
    
    
            static final Random random = new Random();
    
            static void ruffleSort(int[] a) {
                int n = a.length;//shuffle, then sort
                for (int i = 0; i < n; i++) {
                    int oi = random.nextInt(n), temp = a[oi];
                    a[oi] = a[i];
                    a[i] = temp;
                }
                Arrays.sort(a);
            }
    
    
            static class FastScanner {
                BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
                StringTokenizer st = new StringTokenizer("");
    
                String next() {
                    while (!st.hasMoreTokens())
                        try {
                            st = new StringTokenizer(br.readLine());
                        } catch (IOException e) {
                            e.printStackTrace();
                        }
                    return st.nextToken();
                }
    
                int nextInt() {
                    return Integer.parseInt(next());
                }
    
                int[] readArray(int n) {
                    int[] a = new int[n];
                    for (int i = 0; i < n; i++) a[i] = nextInt();
                    return a;
                }
    
                long[] readLongArray(int n) {
                    long[] a = new long[n];
                    for (int i = 0; i < n; i++)
                        a[i] = nextLong();
                    return a;
                }
    
                long nextLong() {
                    return Long.parseLong(next());
                }
            }
    
    
        }
    
    
    
    
    
    
    
    
