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

public class ALG {

	public static void main(String[] args) {
		
		Scanner input1=new Scanner(System.in);
		String[] arg1=input1.nextLine().split(" ");
		String[] arg2=input1.nextLine().split(" ");
		List<Integer> ans=new ArrayList<>();
		
		HashMap<String,Integer> statistics=new HashMap<>();
		for(int i=0;i<arg2.length;i++){
			if(!statistics.containsKey(arg2[i])){
				statistics.put(arg2[i], 1);
			}else{
				statistics.put(arg2[i], statistics.get(arg2[i])+1);
			}
			ans.add(0);
		}

		List<Map.Entry<String, Integer>> list=new ArrayList(statistics.entrySet());
		Collections.sort(list,(o1,o2)->(o1.getValue()-o2.getValue()));
		
		if((list.get(list.size()-1).getValue()>Integer.parseInt(arg1[1]))||(arg2.length<Integer.parseInt(arg1[1])))
		{
			System.out.print("NO");
		}
		else{
			int ans_=1;
			for(int p=0;p<list.size();p++){
				for(int q=0;q<arg2.length;q++){
					if(arg2[q].equals(list.get(list.size()-1-p).getKey())){
						ans.set(q, ans_);
						ans_++;
						if(ans_>Integer.parseInt(arg1[1])){
							ans_=1;
						}
					}
				}
			}
			System.out.println("YES");
			for(int f=0;f<arg2.length;f++){
				System.out.print(ans.get(f));
                                System.out.print(" ");
			}
		}
	}
}
				   		 					  	 	  	 	  				