#include <bits/stdc++.h>
using namespace std;
const int N = 2005;
int a[N], dem[N];
int main() {
  int n, m;
  scanf("%d%d", &n, &m);
  int cnt = 0;
  for (int i = 0; i < n; i++) {
    int tmp;
    scanf("%d", &tmp);
    a[i] = tmp;
    if (tmp <= m)
      dem[tmp]++;
    else
      cnt++;
  }
  int le = 0, ri = n;
  while (le < ri) {
    int mi = (le + ri + 1) >> 1;
    int tmp = cnt;
    for (int i = 1; i <= m; i++) tmp += dem[i] - mi;
    if (tmp >= 0)
      le = mi;
    else
      ri = mi - 1;
  }
  printf("%d", le);
  int tmp = 0;
  for (int i = 1; i <= m; i++)
    if (dem[i] < le) tmp += le - dem[i];
  printf(" %d\n", tmp);
  for (int i = 0; i < n; i++) {
    if (tmp == 0) break;
    if (a[i] > m || dem[a[i]] > le) {
      int j;
      for (j = 1; j <= m; j++)
        if (dem[j] < le) break;
      dem[j]++;
      if (a[i] <= m) dem[a[i]]--;
      a[i] = j;
      tmp--;
    }
  }
  for (int i = 0; i < n; i++) printf("%d ", a[i]);
  return 0;
  return 0;
}
