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.
var line1 = readline().split(" ");
var k = parseInt(line1[1]);
var line2 = readline().split(" ");
line2 = line2.map(Number);

function fun(k,arr) {
    if (k>arr.length){
        return "NO";
    }

    var obj = {};
    var max = 0;
    var result = [];
    var arr1 = arr.concat();
    var len = arr.length;
    for (var i=0;i<len;i++){
        if (!obj[arr[i]]) {
            obj[arr[i]] = 1;
        }else {
            obj[arr[i]]++;
        }
    }
    for (var key in obj){
        if (obj[key]>max){
            max = obj[key];
        }
    }
    if (k<max){
        return "NO";
    }

    arr.sort((a,b)=>a-b);
    var ind = 1;
    for (var j=0;j<len;j++){
        result.push(ind);
        ind++;
        if (ind > k){
            ind = 1;
        }
    }

    for (var i=0;i<len;i++){
        if (arr1[i]!==arr[i]){
            for (var j=i;j<len;j++){
                if (arr[j] === arr1[i]){
                    var temp1 = arr[j];
                    arr[j] = arr[i];
                    arr[i] = temp1;

                    var temp = result[j];
                    result[j] = result[i];
                    result[i] = temp;
                }
                continue;
            }
        }
    }

    var newResult = "";
    for (var i=0;i<len;i++){
        newResult = newResult + result[i] +" ";
    }
    return newResult.trim();
}

var result = fun(k, line2);
if(result !== "NO"){
    print("YES");
    print(result);
}else {
    print(result);
}
 	      	 					 			     		 			