#include<bits/stdc++.h>
using namespace std;

typedef long long int           ll;
typedef unsigned long long int  ull;
typedef vector<int>             vi;
typedef vector<ll>              vll;
typedef vector<vi>              vvi;
typedef pair<int,int>           pii;
typedef vector< pii >           vpii;
typedef set<int>                sti;

#define pb                      push_back
#define pob                     pop_back
#define mp                      make_pair
#define ff                      first
#define ss                      second
#define loop1(i,n)              for(int i=1; i<=int(n); i++)
#define loop(i,y)               for(int i=0; i<int(y); i++)
#define rloop(i,y)              for(int i=int(y); i>0; i--)
#define rloop1(i,y)             for(int i=int(y)-1; i>=0; i--)
#define read()                  freopen("input.txt", "r", stdin)
#define write()                 freopen("output.txt", "w", stdout)
#define cspf(i)                 printf("Case %d: ", i)
/// Constants
#define eps                     1e-9
#define PI                      acos(-1.0)  // 3.1415926535897932

int main()
{
    int n,k,x,cnt;
    cin>>n>>k;
    if(n<k){
        cout<<"NO"<<endl;
        return 0;
    }
    vpii vt(n);
    loop(i,n){
        cin>>vt[i].ff;
        vt[i].ss=i;
    }
    sort(vt.begin(),vt.end());
    vi cl(n);
    x=0;
    cnt=0;
    loop(i,n){
        cnt++;
        if(cnt>k){
            cout<<"NO"<<endl;
            return 0;
        }
        cl[vt[i].ss]=x;
        x=(x+1)%k;
        if(i<n-1){
            if(vt[i].ff!=vt[i+1].ff)
                cnt=0;
        }
    }
    cout<<"YES"<<endl;
    loop(i,n){
        cout<<cl[i]+1;
        if(i<n-1)
            cout<<" ";
    }
    cout<<endl;
    return 0;
}