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.*;

public class ArrayKColoring {

	public static void main(String[] args) throws Exception{
		BufferedReader f = new BufferedReader(new InputStreamReader(System.in));
		
		StringTokenizer st = new StringTokenizer(f.readLine());
		
		int n = Integer.parseInt(st.nextToken());
		int k = Integer.parseInt(st.nextToken());
		
		Pair[] p = new Pair[n];
		st = new StringTokenizer(f.readLine());
		for(int i = 0; i < n; i ++) {
			p[i] = new Pair(Integer.parseInt(st.nextToken()),i);
		}
		
		Arrays.sort(p);
		
		int start = 1;
		int delta = 0;
		int[] ans = new int[n];
		ans[p[0].y] = 1;
		for(int i = 1; i < n; i ++) {
			if(p[i].x != p[i-1].x) {
				delta = 0;
			}
			else {
				delta ++;
			}

			if(delta >= k) {
				System.out.println("NO");
				System.exit(0);
			}
			start = start % k + 1;
			
			ans[p[i].y] = (start - 1) % k + 1 ;
		}
		
		System.out.println("YES");
		for(int i = 0; i < n; i ++) {
			System.out.print(ans[i] + " ");
		}
		
		
	}
	
	static class Pair implements Comparable<Pair>{
		int x, y;
		Pair(int x, int y){
			this.x = x;
			this.y = y;
		}
		@Override
		public int compareTo(Pair o) {
			if(x == o.x) {
				return y - o.y;
			}
			return x - o.x;
		}
	}

}
