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.BufferedReader;
import java.io.BufferedWriter;
import java.io.FileWriter;
import java.io.IOException;
import java.io.InputStreamReader;
import java.math.BigInteger;
import java.util.ArrayList;
import java.util.Arrays;
import java.util.Collections;
import java.util.HashMap;
import java.util.HashSet;
import java.util.List;
import java.util.Map;
import java.util.Scanner;
import java.util.Set;
import java.util.regex.Matcher;
import java.util.regex.Pattern;

import static java.util.stream.Collectors.joining;

public class Main {

    static void solve() {
        Scanner scan = new Scanner(System.in);
        int n = scan.nextInt();
        int k = scan.nextInt();
        int[] res = new int[n];

        Map<Integer, List<Integer>>map = new HashMap<>();
        for (int i=0;i<n;i++){
            int val=scan.nextInt();

            if(map.containsKey(val)) {
                List<Integer>list = map.get(val);
                list.add(i);
                if(list.size()>k){
                    System.out.println("NO");
                    return;
                }
                map.put(val, list);
            }else{
                List<Integer>list = new ArrayList<>();
                list.add(i);
                map.put(val, list);
            }
        }
        int currK = 1;
        Set<Integer>used = new HashSet<>();
        for(Map.Entry<Integer, List<Integer>>entry:map.entrySet()){
            List<Integer>list = entry.getValue();
            for (int ind:list){
                res[ind]=currK;
                used.add(currK);
                currK++;
                if(currK>k){
                    currK=1;
                }
            }
        }

        if(used.size() == k){
            System.out.println("YES");
            for(int i=0;i<n;i++){
                System.out.print(res[i] + " ");
            }
        }else{
            System.out.println("NO");
        }


//        System.out.println(1);
    }


    public static void main(String[] args) {
//        int[] nums = new int[] {0,3,2,1};
//        System.out.println(res);
        solve();
//        Main m = new Main();
//        Scanner scan = new Scanner(System.in);
//        long n = scan.nextLong();
//        long r = scan.nextLong();
//        List<Long> list = new ArrayList<>();
////        int[] arr = new int[n];
//        for (long i=0;i<n;i++){
//            list.add(scan.nextLong());
//        }
//        System.out.println(res);
//        solve(n, arr);
//        scan.close();
    }
}
