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

	static class comp implements Comparator<pair> {

		@Override
		public int compare(pair o1, pair o2) {
			return o1.idx - o2.idx;
		}

	}

	
	static class pair implements Comparable<pair> {
		int idx;
		int val;
		int col;

		pair(int a, int b) {
			this.idx = a;
			this.val = b;
		}

		@Override
		public int compareTo(pair o) {

			return (int) (this.val - o.val);

		}
	}

	
	public static void main(String[] args) {
		// TODO Auto-generated method stub

		Scanner scn = new Scanner(System.in);

		int n = scn.nextInt(), k = scn.nextInt();
		
		if(k>n){
			System.out.println("NO");
			return;
		}

		ArrayList<pair> p = new ArrayList<>();
		boolean[] ca = new boolean[k + 1];
		HashMap<Integer, Integer> hm = new HashMap<>();

		for (int i = 0; i < n; i++) {
			int x = scn.nextInt();
			p.add(new pair(i, x));

			hm.put(x, hm.containsKey(x) ? hm.get(x) + 1 : 1);
			if (hm.get(x) > k) {
				System.out.println("NO");
				return;
			}
		}

		Collections.sort(p);

		p.get(0).col = 1;
		ca[1] = true;

		for (int i = 1; i < p.size(); i++) {

			if (p.get(i).val == p.get(i - 1).val) {
				int c = p.get(i - 1).col + 1;
				if (c > k)
					c = 1;
				p.get(i).col = c;
				ca[c] = true;
			}

			else
				p.get(i).col = f(ca);
		}

		Collections.sort(p, new comp());
System.out.println("YES");
		for (pair t : p)
			System.out.print(t.col + " ");

	}

	public static int f(boolean[] ca) {

		for (int i = 1; i < ca.length; i++) {
			if (ca[i] == false) {
				ca[i] = true;
				return i;
			}
		}
		return 1;
	}
	}


