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.
/*
 * To change this license header, choose License Headers in Project Properties.
 * To change this template file, choose Tools | Templates
 * and open the template in the editor.
 */
import java.util.*;
import javafx.util.*;

/**
 *
 * @author arvin
 */
public class Array_k_coloring {
    
    
    public static void main(String args[])
    {
        Scanner sc=new Scanner(System.in);
        int n=sc.nextInt();
        int k=sc.nextInt();
        sc.nextLine();
        Pair<Integer,Integer> a[]=new Pair[n];
        int b[]=new int[n];
        int c[]=new int[n];
        boolean g[]=new boolean[n];
        Arrays.fill(g,false);
        String abc[]=sc.nextLine().split(" ");
        for(int i=0;i<n;i++)
            a[i]=new Pair<>(i,Integer.parseInt(abc[i]));
        
        Arrays.sort(a,new ef());
        int ch=1,f=0;
        int ma=1;
        b[0]=1;
        for(int i=1;i<n;i++)
        {
            if(Objects.equals(a[i].getValue(), a[i-1].getValue()))
                b[i]=++ch;
            else
                b[i]=ch=1;
            if(ch>k)
            {
                f=1;
                break;
            }
            ma=Math.max(ma,ch);
        }
        //System.out.println(ma);
        if(f==1 || n<k)
            System.out.println("NO");
        else
        {
            if(ma<k)
            {
                g[b[0]]=true;
                for(int i=1;i<n && ma<k;i++)
                {
                    if(g[b[i]])
                        b[i]=++ma;
                    else
                        g[b[i]]=true;
                }
            }
            for(int i=0;i<n;i++)
                c[a[i].getKey()]=b[i];
            System.out.print("YES\n");
            for(int i=0;i<n;i++)
                System.out.print(c[i]+" ");
        }
        
        sc.close();
    }
}
class ef implements Comparator<Pair<Integer,Integer>>
{
    public int compare(Pair<Integer,Integer> a,Pair<Integer,Integer> b)
    {
        return a.getValue()-b.getValue();
    }
}