#include <stdio.h>
#include <algorithm>

using namespace std;

#define Nmax 30001

int a[Nmax];
int b[Nmax];
int frecv[Nmax];
int i,k,n,j;

int main()
{
	freopen("partitie.in","r",stdin);
	freopen("partitie.out","w",stdout);
	
	scanf("%ld %ld", &n,&k);
	for (i=1;i<=n;++i)
	{
		scanf("%ld", &a[i]);
        b[i]=a[i];
	}
    sort(b+1,b+n+1);
	k--;
	printf("%ld\n", k);
	
    for (i=1;i<=n;++i)
    {
		if (i%k!=0)
		frecv[i]=(i%k);
	    else
		frecv[i]=k;
	}
	for (i=1;i<=n;++i)
		for (j=1;j<=n;++j)
			 if (a[i]==b[j])
				 printf("%ld\n", frecv[j]);
return 0;
}