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.*;
import java.util.*;
import java.util.stream.*;
/**

 * Built using CHelper plug-in

 * Actual solution is at the top

 * Author: Wavator

 */
public class Main{
    public static void main(String[] args){
        InputStream inputStream = System.in;//new FileInputStream("C:\\Users\\wavator\\Downloads\\test.in");
        OutputStream outputStream = System.out;
        InputReader in = new InputReader(inputStream);
        PrintWriter out = new PrintWriter(outputStream);
        Task solver = new Task();
        solver.solve(in, out);
        out.close();
    }
    public static Comparator<node> nodeComparator=new Comparator<node>() {
        @Override
        public int compare(node o1, node o2) {
            return o1.data-o2.data;
        }
    };
    public static Comparator<node> nodeComparator2=new Comparator<node>() {
        @Override
        public int compare(node o1, node o2) {
            return o1.index-o2.index;
        }
    };
    static class Task {
        public void solve(InputReader in, PrintWriter out) {

            while (in.hasNext()) {
                  int n=in.nextInt();
                  int k=in.nextInt();
                  node a[]=new node[n];
                for (int i = 0; i < n; i++) {
                    a[i]=new node(in.nextInt(),i);
                }
                Arrays.sort(a,nodeComparator);
                a[0].color=1;
                boolean res=true;
                int count=1;
                for (int i = 1; i < n; i++) {
                    a[i].color=a[i-1].color+1;
                    if (a[i].color>k){
                        a[i].color-=k;
                    }
                    if (a[i].data==a[i-1].data){
                        count++;
                        if (count>k){
                            res=false;
                            break;
                        }
                    }else {
                        count=1;
                    }
                }
                Arrays.sort(a,nodeComparator2);
                if (res){
                    out.println("YES");
                    for (node i:a) {
                        out.print(i.color+" ");
                    }
                }else {
                    out.print("NO");
                }
            }
        }
    }
    static class node{
        int data;
        int color;
        int index;
        node(int data,int index){
            this.data=data;
            this.index=index;
        }
    }

    static class InputReader {
        public BufferedReader reader;
        public StringTokenizer tokenizer;
        InputReader(InputStream stream) {
            reader = new BufferedReader(new InputStreamReader(stream), 32768);
            tokenizer = null;
        }
        public String next() {
            while (tokenizer == null || !tokenizer.hasMoreTokens()) {
                try {
                    tokenizer = new StringTokenizer(reader.readLine());
                } catch (IOException e) {
                    throw new RuntimeException(e);
                }
            }
            return tokenizer.nextToken();
        }
        public int nextInt() {
            return Integer.parseInt(next());
        }
        public long nextLong() {
            return Long.parseLong(next());
        }
        public double nextDouble() {
            return Double.parseDouble(next());
        }
        public char[] nextCharArray() {
            return next().toCharArray();
        }
        public boolean hasNext() {
            try {
                String string = reader.readLine();
                if (string == null) {
                    return false;
                }
                tokenizer = new StringTokenizer(string);
                return tokenizer.hasMoreTokens();
            } catch(IOException e) {
                return false;
            }
        }
        public BigInteger nextBigInteger() {
            return new BigInteger(next());
        }

        public BigDecimal nextBigDecinal() {
            return new BigDecimal(next());
        }

    }

}
