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.OutputStream;
import java.io.IOException;
import java.io.InputStream;
import java.io.OutputStream;
import java.io.PrintWriter;
import java.io.BufferedWriter;
import java.util.HashMap;
import java.util.InputMismatchException;
import java.io.IOException;
import java.util.TreeSet;
import java.util.HashSet;
import java.io.Writer;
import java.io.OutputStreamWriter;
import java.io.InputStream;

/*
 * Copyright (c) --> Arpit
 * Date Created : 4/8/2020
 * Have A Good Day !
 */

/**
 * Built using CHelper plug-in
 * Actual solution is at the top
 *
 * @author Arpit
 */
public class Main {
    public static void main(String[] args) {
        InputStream inputStream = System.in;
        OutputStream outputStream = System.out;
        FastReader in = new FastReader(inputStream);
        OutputWriter out = new OutputWriter(outputStream);
        BArrayKColoring solver = new BArrayKColoring();
        solver.solve(1, in, out);
        out.close();
    }
    
    static class BArrayKColoring {
        public void solve(int testNumber, FastReader r, OutputWriter out) {
            
            int n = r.nextInt(), k = r.nextInt();
            int arr[] = r.nextIntArray(n);
            
            int[] ans = new int[n];
            
            HashMap<Integer, Integer> freq = new HashMap<>();
            for (int i = 0; i < arr.length; i++) {
                int fr = 0;
                if (freq.containsKey(arr[i])) {
                    fr = freq.get(arr[i]);
                }
                fr++;
                freq.put(arr[i], fr);
            }
            
            int max = Integer.MIN_VALUE;
            for (int key : freq.keySet()) max = Math.max(max, freq.get(key));
            
            if (max > k) {
                out.print("NO");
            } else {

//            System.out.println("KInbeckeb");
                int ele = 1;
                HashSet<Integer> vals = new HashSet<>();
                
                HashMap<Integer, TreeSet<Integer>> map = new HashMap<>();
                
                for (int i = 0; i < n; i++) {
                    if (!map.containsKey(arr[i])) {
                        vals.add(ele);
                        ans[i] = ele;
                        TreeSet<Integer> temp = new TreeSet<>();
                        temp.add(ele);
                        map.put(arr[i], temp);
                        ele++;
                        if (ele > k) ele = 1;
                    }
                }
                
                boolean flag = false;
                if (vals.size() == k) flag = true;
                
                HashSet<Integer> rem = new HashSet<>();
                if (!flag) {
                    for (int i = 1; i <= k; i++) {
                        if (!vals.contains(i)) rem.add(i);
                    }
                }

//            out.debugln("ans", ans);
                
                TreeSet<Integer> temp;
                for (int i = 0; i < n; i++) {
                    if (ans[i] == 0) {
                        temp = map.get(arr[i]);
                        if (flag) {
                            for (int j = 1; j <= k; j++) {
                                if (!temp.contains(j)) {
                                    temp.add(j);
                                    map.put(arr[i], temp);
                                    ans[i] = j;
                                    break;
                                }
                            }
                        } else {
                            for (int el : rem) {
                                if (!temp.contains(el)) {
                                    temp.add(el);
                                    map.put(arr[i], temp);
                                    ans[i] = el;
                                    rem.remove(el);
                                    break;
                                }
                            }
                            if (rem.isEmpty()) flag = true;
                        }
                    }
                }
                
                if (rem.isEmpty()) {
                    out.println("YES");
                    out.print(ans);
                }
                
            }
            
        }
        
    }
    
    static class OutputWriter {
        private final PrintWriter writer;
        
        public OutputWriter(OutputStream outputStream) {
            writer = new PrintWriter(new BufferedWriter(new OutputStreamWriter(outputStream)));
        }
        
        public OutputWriter(Writer writer) {
            this.writer = new PrintWriter(writer);
        }
        
        public void print(Object... objects) {
            for (int i = 0; i < objects.length; i++) {
                writer.print(objects[i]);
                if (i != objects.length - 1) writer.print(" ");
            }
        }
        
        public void println(Object... objects) {
            print(objects);
            writer.println();
        }
        
        public void print(int[] array) {
            for (int i = 0; i < array.length; i++) {
                writer.print(array[i]);
                if (i != array.length - 1) writer.print(" ");
            }
        }
        
        public void close() {
            writer.close();
        }
        
    }
    
    static class FastReader {
        private InputStream stream;
        private byte[] buf = new byte[1024];
        private int curChar;
        private int numChars;
        private FastReader.SpaceCharFilter filter;
        
        public FastReader(InputStream stream) {
            this.stream = stream;
        }
        
        public int read() {
            if (numChars == -1) {
                throw new InputMismatchException();
            }
            if (curChar >= numChars) {
                curChar = 0;
                try {
                    numChars = stream.read(buf);
                } catch (IOException e) {
                    throw new InputMismatchException();
                }
                if (numChars <= 0) {
                    return -1;
                }
            }
            return buf[curChar++];
        }
        
        public int nextInt() {
            int c = read();
            while (isSpaceChar(c)) {
                c = read();
            }
            int sgn = 1;
            if (c == '-') {
                sgn = -1;
                c = read();
            }
            int res = 0;
            do {
                if (c < '0' || c > '9') {
                    throw new InputMismatchException();
                }
                res *= 10;
                res += c - '0';
                c = read();
            } while (!isSpaceChar(c));
            return res * sgn;
        }
        
        public boolean isSpaceChar(int c) {
            if (filter != null) {
                return filter.isSpaceChar(c);
            }
            return isWhitespace(c);
        }
        
        public static boolean isWhitespace(int c) {
            return c == ' ' || c == '\n' || c == '\r' || c == '\t' || c == -1;
        }
        
        public int[] nextIntArray(int n) {
            int[] array = new int[n];
            for (int i = 0; i < n; ++i) array[i] = nextInt();
            return array;
        }
        
        public interface SpaceCharFilter {
            public boolean isSpaceChar(int ch);
            
        }
        
    }
}

