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

	public static void main(String[] args) 
	{
		Scanner s = new Scanner(System.in);
		int n =s.nextInt();
		int k = s.nextInt();
		int arr[][] = new int[n][k+1];
		int cou = 1;
		int uniq = 0;
		String ans = "";
		for (int i = 0; i<n;i++)
		{
			int j = s.nextInt();
			int l = contains(arr,j);
			if (l == (-1))
			{
				if (cou <=k)
				{
				arr[uniq][0] = j;
				arr[uniq][cou] = 1;
				ans = ans + cou + " ";
				uniq++;
				cou++;
				}
				else 
				{
					arr[uniq][0] = j;
					arr[uniq][1] = 1;
					uniq++;
					ans = ans + "1 ";
				}
			}
			else
			{
				if (cou<=k)
				{
					arr[l][cou] = 1;
					ans = ans + cou + " ";
					cou++;
				}
				else 
				{
					int q = 1;
					while (q<=k && arr[l][q] !=0 )
					{
						q++;
					}
					if (q>k)
					{
						ans = "NO";
						break;
					}
					arr[l][q] = 1;
					ans = ans + q + " ";
				}
			}
		}
		if (ans.equals("NO"))
		{
		System.out.println(ans);
		}
		else 
		{
			ans = ans.substring(0, ans.length() - 1);
			System.out.println("YES");
			System.out.println(ans);
		}
		
	}
	public static int contains(int[][] arr, int k)
	{
		int ans = -1;
		for (int i = 0; i<arr.length;i++)
		{
			if (arr[i][0]==k)
				{
				ans = i;
				break;
				}
		}
		return ans;
	}

}
