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.*;
import java.io.*;
public class A
{
    static BufferedReader br=new BufferedReader(new InputStreamReader(System.in));
    static BufferedWriter bw=new BufferedWriter(new OutputStreamWriter(System.out));
    static StringTokenizer st=null;
    static String next()
    {
        while(st==null || !st.hasMoreElements())
        {
            try{
                st=new StringTokenizer(br.readLine());
            } catch (IOException e){
                e.printStackTrace();
            }
        }
        return st.nextToken();
    }
    static int nextInt()
    {
        return Integer.parseInt(next());
    }
    static long nextLong()
    {
        return Long.parseLong(next());
    }
    
    static double nextDouble(){
        return Double.parseDouble(next());
    }
    static class T
    {
        TreeSet<Integer> ts;
        T()
        {
            ts=new TreeSet<Integer>();
        }
    }
   public static void main(String[] args) {
        try{
              int n=nextInt();
              int k=nextInt();
              int fr[]=new int[5002];
              int a[]=new int[5002];
              for(int i=1;i<=n;i++)
              {
                  a[i]=nextInt();
                  fr[a[i]]++;
              }
              T c[]=new T[5002];
              for(int i=0;i<=5000;i++)
              {
                  c[i]=new T();
              }
              int color=1;
              int flag=0;
              int flag2=0;
              for(int i=1;i<=5000;i++)
              {
                  if(fr[i]>0 && fr[i]<=k)
                  {
                      for(int j=0;j<fr[i];j++)
                      {
                          if(color==k)
                          {
                              flag2++;
                          }
                          c[i].ts.add(color);
                          color++;
                          if(color>k)
                          {
                              color=1;
                          }
                      }
                  }
                  else if(fr[i]>k)
                  {
                      flag++;
                      break;
                  }
              }
              if(flag==0 && flag2>0)
              {
                  bw.write("YES\n");
                  for(int i=1;i<=n;i++)
                  {
                      int x=a[i];
                      bw.write(c[x].ts.first()+" ");
                      c[x].ts.remove(c[x].ts.first());
                  }
              }
              else
              {
                  bw.write("NO\n");
              }
              bw.flush();
        } catch (Exception e) {
            e.printStackTrace();
        }
    }
} 