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 B
{

	static StringBuilder st = new StringBuilder();
	
	public static void main(String[] args) throws Exception 
	{
		
		Scanner sc = new Scanner(System.in);
		PrintWriter out = new PrintWriter(System.out);
		
		int n = sc.nextInt()  , k = sc.nextInt(); 
		
		int [] a = new int [n] ; 
		
		for(int i = 0 ; i < n ; i++) a[i] = sc.nextInt() ; 
		
		ArrayList<Integer>[] lvls = new ArrayList[5001];
		for(int i = 0 ;i <= 5000 ; i++)
			lvls[i] = new ArrayList<>() ; 
		
		for(int i = 0 ; i < n ;i++)
			lvls[a[i]].add(i) ; 
		
		int [] ans = new int [n] ; 
		int c = 1 ; 
		for(int i = 0 ;i <= 5000 ; i++)
			if(!lvls[i].isEmpty())
			{
				if(lvls[i].size() > k)
				{
					System.out.println("NO");
					return ; 
				}
				for(int idx : lvls[i])
				{
					ans[idx] = c++ ;
					if(c > k) c = 1 ; 
						
					
				}
			}
		
		boolean [] vis = new boolean [k+1] ;
		
		for(int x : ans) vis[x] = true ; 
		boolean can = true ; 
		
		for(int i = 1 ; i <= k ; i++) can &=vis[i] ; 
		if(!can)
		{
			System.out.println("NO");
			return ; 
		}
		out.println("YES");
		
		for(int x : ans)out.print(x+" ");
		
		
		
		out.flush();
		out.close();
		
	}
	
	
	
	static class Scanner 
	{
		BufferedReader br;
		StringTokenizer st;

		Scanner(InputStream in) 
		{
			 br = new BufferedReader(new InputStreamReader(System.in));
		}
		
		String next() throws Exception 
		{
			while (st == null || !st.hasMoreTokens())
				st = new StringTokenizer(br.readLine());
			return st.nextToken();
		}

		int nextInt() throws Exception { return Integer.parseInt(next()); }

		long nextLong() throws Exception { return Long.parseLong(next()); }

		double nextDouble() throws Exception { return Double.parseDouble(next()); }
		
	}

	static void shuffle(int[] a) 
	{
		int n = a.length;
		for (int i = 0; i < n; i++) 
		{
			int r = i + (int) (Math.random() * (n - i));
			int tmp = a[i];
			a[i] = a[r];
			a[r] = tmp;
		}
	}


}