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.OutputStream;
import java.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.io.InputStreamReader;
import java.util.StringTokenizer;
import java.io.BufferedReader;
import java.io.InputStream;
import java.util.Arrays;
import java.util.HashMap;
import java.util.ArrayList;
import java.util.Map;
public class Main {
    public static void main(String[] args) {
        InputStream inputStream = System.in;
        OutputStream outputStream = System.out;
        InputReader in = new InputReader(inputStream);
        PrintWriter out = new PrintWriter(outputStream);
        Task solver = new Task();
		solver.solve(1, in, out);
        out.close();
    }
	
	

    static class Task {
		int n,k,max,ind,color,rem;
		int[] arr,ans;
		HashMap<Integer,Integer> countMap;
		HashMap<Integer,ArrayList<Integer>> positionsMap;
		
		public void computeAns(){
			for(Map.Entry<Integer,ArrayList<Integer>> entry : positionsMap.entrySet()){
				if(rem==0)
					break;
				if(entry.getKey() == ind){
					continue;
				}
				ArrayList<Integer> list=entry.getValue();
				int size=list.size();
				for(int i=0;i<size && rem!=0;i++){
					ans[list.get(i)]=color;
					color++;
					rem--;
				}
			}
		}
		
		public void printAns(PrintWriter out){
			for(int i=0;i<n;i++){
				out.print(ans[i]+" ");
			}
			out.println();
		}
		
		public int solve(int testNumber, InputReader in, PrintWriter out) {
			n=in.nextInt();
			k=in.nextInt();
			arr=new int[n];
			ans=new int[n];
			countMap=new HashMap<Integer,Integer>() ;
			positionsMap=new HashMap<Integer,ArrayList<Integer>>();
			max=0;
			ind=0;
			
			for(int i=0;i<n;i++){
				arr[i]=in.nextInt();
				countMap.put(arr[i],0);
				positionsMap.put(arr[i],new ArrayList<Integer>());
			}
			int count;
			for(int i=0;i<n;i++){
				count=countMap.get(arr[i]);
				count++;
				ans[i]=count;
				countMap.put(arr[i],count);
				positionsMap.get(arr[i]).add(i);
				if(max < count){
					max=count;
					ind=arr[i];
				}
			}
			//System.out.println("test "+k+" "+max);
			if(max > k){
				out.println("NO");
				return 0;
			}
			else if(max == k){
				out.println("YES");
				printAns(out);
			}
			else{
				if(n-max >= k-max ){
					out.println("YES");
					color=max+1;
					rem=k-max;
					computeAns();
					printAns(out);
				}
				else{
					out.println("NO");
				}
			}
			
			return 0;
		}
	}
    static class InputReader {
        public BufferedReader reader;
        public StringTokenizer tokenizer;

        public InputReader(InputStream stream) {
            reader = new BufferedReader(new InputStreamReader(stream), 32768);
            tokenizer = null;
        }

        public String next() {
            while (tokenizer == null || !tokenizer.hasMoreTokens()) {
                try {
                    tokenizer = new StringTokenizer(reader.readLine());
                } catch (IOException e) {
                    throw new RuntimeException(e);
                }
            }
            return tokenizer.nextToken();
        }

        public int nextInt() {
            return Integer.parseInt(next());
        }

        public long nextLong() {
            return Long.parseLong(next());
        }

    }
}