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.InputStream;
import java.io.PrintWriter;
import java.io.OutputStream;
import java.io.IOException;
import java.io.BufferedReader;
import java.io.InputStreamReader;
import java.util.Arrays;
import java.util.Collections;
import java.util.StringTokenizer;
import java.util.ArrayList;
import java.util.Comparator;

public class Main {
	public static final int N = 5005;
	
	static class Data {
		int value, index;
		public Data (int value, int index) {
			this.value = value;
			this.index = index;
		}
	}
	
	static class cmp implements Comparator <Data> {
		public int compare (Data a, Data b) {
			return a.value - b.value;
		}
	}
	
	static class Task {
		int n, k, ans[] = new int[N], cnt[] = new int[N];
		ArrayList <Integer> unused = new ArrayList <Integer>();
		ArrayList <Data> a = new ArrayList <Data>();
		public void solve (int testNumber, InputReader in, PrintWriter out) {
			n = in.nextInt(); k = in.nextInt();
			for (int i = 1; i <= n; i++) {
				int x = in.nextInt();
				a.add(new Data(x, i));
			}
			
			Collections.sort(a, new cmp());
			int ptr = 0;
			for (int i = 0; i < a.size(); i = ptr) {
				while (ptr < a.size() && a.get(ptr).value == a.get(i).value) ptr++;
				if (ptr - i > k) {
					out.print("NO");
					return;
				}
			}
			
			ptr = 0;
			for (int i = 0; i < a.size(); i = ptr) {
				while (ptr < a.size() && a.get(ptr).value == a.get(i).value) {
					ans[a.get(ptr).index] = ptr - i + 1;
					cnt[ptr - i + 1]++;
					ptr++;
				}
			}
			
			for (int i = 1; i <= k; i++) if (cnt[i] == 0) unused.add(i);
			for (int color: unused) {
				for (int i = 1; i <= n; i++) {
					if (cnt[ans[i]] > 1) {
						cnt[ans[i]]--;
						cnt[color]++;
						ans[i] = color;
						break;
					}
				}
			}
			
			out.println("YES");
			for (int i = 1; i <= n; i++) out.print(ans[i] + " ");
		}
	}
	
	static class InputReader {
		public BufferedReader reader;
		public StringTokenizer tokenizer;
		public 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 static void main (String []args) {
		InputStream inputStream = System.in;
		OutputStream outputStream = System.out;
		InputReader in = new InputReader(inputStream);
		PrintWriter out = new PrintWriter(outputStream);
		Task solver = new Task();
		solver.solve(1, in, out);
		out.close();
	}
}