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 week4 {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int n =sc.nextInt();
        int k = sc.nextInt();
        int[] arr = new int[n];
        Map<Integer,Integer> map =new HashMap<>();
        for (int i=0;i<n;i++){
            int temp = sc.nextInt();
            arr[i] = temp;
            if (map.containsKey(temp)){
                map.put(temp,map.get(temp)+1);
            }else {
                map.put(temp,1);
            }
        }
        week4 w =new week4();
        if (w.yesOrNo(map,n,k)){
            System.out.println("YES");
            int[] ans=w.newAnswer(arr,n,k);
            for (int e:ans){
                System.out.println(e);
            }
        }else
            System.out.println("NO");
    }

    public boolean yesOrNo(Map<Integer,Integer> map,int n ,int k){
        Set<Integer> difNum = map.keySet();
        int maxNum =0;
        for (int e:difNum){
            if (maxNum<map.get(e)){
                maxNum = map.get(e);
            }
        }
        if (n>=k && k>=maxNum){
            return true;
        }else
            return false;
    }
    public int[] newAnswer(int[] arr,int n,int k){
        int[] brr =new int[n];
        int[] crr =new int[n];
        int index=1;
        for (int i=0;i<n;i++){
            brr[i]=index;
            index++;
            if (index>k){
                index=1;
            }
        }
        int idx=0;
        int num =1;
        while (num<=5000) {
            for (int i=0;i<n;i++) {
                if (arr[i] == num) {
                    crr[idx] = i;
                    idx++;
                }
            }
            num++;
        }
        int[] drr=new int[n];
        for (int i=0;i<n;i++){
            drr[crr[i]] =brr[i];
        }
       return  drr;
    }
}
	  	   	  		  				   		   				