#include<iostream>#include<cstring>#include<cstdio>#include<algorithm>#include<cmath>#define INF 0x3f3f3f3fusing namespace std;int a[2005],b[2005] = {0};int main(){    int m,n;    scanf("%d%d",&n,&m);    for(int i = 1;i <= n;i++)    {                scanf("%d",&a[i]);            if(a[i] <= m)    b[a[i]]++;    }    int ans = n/m;    int cnt = 0;        for(int i = 1;i <= n;i++)    {        if(a[i] > m || a[i] <= m && b[a[i]] > ans)        {            int j;            for(j = 1;j <= m;j++)            {                if(b[j] < ans)    break;            }            if(j == m+1)    break;            if(a[i] <= m)    b[a[i]]--;            a[i] = j;            b[j]++;            num++;        }    }        printf("%d %d\n",ans,num);    int flag = 1;    for(int i = 1;i <= n;i++)    {        if(flag)        {            printf("%d",a[i]);            flag = 0;        }        else        {            printf(" %d",a[i]);        }    }    printf("\n");    return 0;}