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.util.HashMap;
import java.util.HashSet;
import java.util.StringTokenizer;

public class B {

    public static void main(String[] args) {
        InputReader reader = new InputReader(System.in);
        PrintWriter writer = new PrintWriter(System.out);

        int n = reader.readInt();
        int k = reader.readInt();

        int[] color = new int[n];

        HashMap<Integer, HashSet<Integer>> colors = new HashMap<>();
        for(int i = 0; i < k; i++)
            colors.put(i, new HashSet<Integer>());


        boolean found = false;
        int m = 0;
        for(int i = 0; i < n; i++) {
            found = false;
            int x = reader.readInt();
            for(int j = 0; j < k; j++) {
                if(!colors.get(m).contains(x)) {
                    colors.get(m).add(x);
                    color[i] = m + 1;
                    found = true;
                    m = (m+1)%k;
                    break;
                } else {
                    m = (m+1)%k;
                }
            }
            if(!found)
                break;
        }

        if(k>n) {
            writer.println("NO");
            writer.close();
            return;
        }

        if(!found)
            writer.println("NO");
        else {
            for(int i = 0; i < k; i++) {
                if(colors.get(i).size() == 0) {
                    found = false;
                    break;
                }
            }
            if(!found) {
                writer.println("NO");
            } else {
                writer.println("YES");
                for(int i: color)
                    writer.print(i + " ");
            }

        }



        writer.close();
    }

    public static class InputReader {
        StringTokenizer st;
        BufferedReader br;

        public InputReader(InputStream is) {
            br = new BufferedReader(new InputStreamReader(is));
        }

        public String readWord() {
            if(st == null || !st.hasMoreTokens()) {
                try {
                    String s = br.readLine();
                    st = new StringTokenizer(s);
                } catch (IOException e) {
                    throw new RuntimeException(e);
                }
            }

            return st.nextToken();
        }

        public long readLong() {
            return Long.parseLong(readWord());
        }

        public int readInt() {
            return Integer.parseInt(readWord());
        }
    }

}
