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.InputStreamReader;
import java.util.Arrays;
import java.util.Comparator;
import java.util.Scanner;

public class Main {
	
	public static void main(String[] args) {

		Scanner in = new Scanner(new BufferedReader(new InputStreamReader(System.in)));
		
		int n = in.nextInt();
		int k = in.nextInt();
		
		Pair[] a = new Pair[n];
		int[] mcor = new int[k];
		int[] ma = new int[5001];
		
		boolean possible = true;
		
		for(int i = 0; i < n; i++) {
			a[i] = new Pair(i, in.nextInt());
			ma[a[i].valor]++;
			if(ma[a[i].valor] > k) possible = false;
		}
		
		Arrays.sort(a);

		int cor = 0;
		
		for(int i = 0; i < n; i++) {
			
			mcor[cor] = 1;
			a[i].color = cor;
			cor = (cor + 1) % k;
			
		}
		
		for(int i = 0; i < k; i++) {
			if(mcor[i] == 0) possible = false;
		}

		if(possible) {
			System.out.println("YES");
			Arrays.sort(a, new Comparator<Pair>() {
				@Override
				public int compare(Pair a, Pair b) {

					if(a.index == b.index) return 0;
					if(a.index > b.index) return 1;
					
					return -1;
				}
			});
			
			for(int i = 0; i < n; i++) {
				System.out.print((a[i].color + 1) + " ");
			}
			
			System.out.println();
		}
		else {
			System.out.println("NO");
		}
	}
	
	public static void print(Pair[] a) {
		
		for(int i = 0; i < a.length; i++) {
			System.out.println(a[i].index + ", " + a[i].valor + ", " + a[i].color);
		}
		
	}
	
}

class Pair implements Comparable<Pair>{
	
	public int index;
	public int valor;
	public int color;
	
	public Pair(int index, int valor) {
		this.index = index;
		this.valor = valor;
	}
	
	@Override
	public int compareTo(Pair p) {
		
		if(p.valor == valor) return 0;
		if(p.valor > valor) return -1;
		
		return 1;
	}
	
	
	
}