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

public class Array_K_Coloring {
	public static void main(String[] args) throws IOException{
		BufferedReader in = new BufferedReader(new InputStreamReader(System.in));
		PrintWriter out = new PrintWriter(System.out);
		
		StringTokenizer st = new StringTokenizer(in.readLine());
		
		int n = Integer.parseInt(st.nextToken());
		int k = Integer.parseInt(st.nextToken());
		
		
		int[][] a = new int[n][3];
		
		st = new StringTokenizer(in.readLine());
		for(int i = 0; i < n; i++) {
			a[i][0] = Integer.parseInt(st.nextToken());
			a[i][1] = i;
		}
		
		int[] ocu = new int[k+1];
		
		Arrays.sort(a, (x,y) -> {return Integer.compare(x[0], y[0]);});
		
		int max = 0;
		
		boolean valid = true;
		a[0][2] = 1;
		ocu[1]++;
		for(int i = 1; i < n; i++) {
			if(a[i][0] == a[i-1][0]) {
				a[i][2] = a[i-1][2] + 1;
				max = Math.max(a[i][2], max);
				if(a[i][2] > k) {
					valid = false;
					break;
				}
				ocu[a[i-1][2]+1]++;
			}
			else {
				a[i][2] = 1;
				ocu[1]++;
			}
		}
		
		
		
		if(valid) {
			if(max < k) {
				max += 1;
				for(int i = 0; i < n && max <= k; i++) {
					if(ocu[a[i][2]] > 1) {
						ocu[a[i][2]]--;
						a[i][2] = max++;
						ocu[a[i][2]]++;
					}
				}
			}
			Arrays.sort(a, (x,y) -> {return Integer.compare(x[1], y[1]);});
			
			
			
			out.println("YES");
			out.print(a[0][2]);
			for(int i = 1; i < n; i++)
			out.print(" " + a[i][2]);
			out.println();
		}
		else
			out.println("NO");
	
		
		
		out.close();
	}
}
