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.util.Scanner;

public class Main {

	public static void main(String[] args) {
		Scanner sc = new Scanner(System.in);
		int n = sc.nextInt(), k = sc.nextInt();
		int[] a = new int[n + 1], tol = new int[5005], ans = new int[n + 1];
		int[][] t = new int[n + 1][5005];
		for (int i = 1; i < a.length; i++) {
			a[i] = sc.nextInt();
		}
		sc.close();
		for (int i = 1; i < a.length; i++) {
			tol[a[i]]++;
		}
		for (int i = 1; i < tol.length; i++) {
			if (tol[i] > k) {
				System.out.println("NO");
				System.exit(0);
			}
		}
		n = 1;
		for (int i = 1; i < a.length; i++) {
			if (n < k + 1) {
				ans[i] = n;
				t[n][a[i]] = 1;
				n++;
			} else {
				for (int j = 1; j < k + 1; j++) {
					if (t[j][a[i]] == 0) {
						ans[i] = j;
						t[j][a[i]] = 1;
						break;
					}
				}
			}
		}
		System.out.println("YES");
		for (int i = 1; i < ans.length; i++) {
			if (i != ans.length - 1)
				System.out.print(ans[i] + " ");
			else
				System.out.println(ans[i]);
		}
	}
}
	  	 		 		 		    		 	   		  		