#include <bits/stdc++.h>
int m, n, a[3000];
int ans1, ans2;
int cnt[3000];
int main() {
  scanf("%d%d", &n, &m);
  int i, j;
  for (i = 0; i < n; i++) {
    scanf("%d", &a[i]);
    if (a[i] <= m) cnt[a[i]]++;
  }
  ans1 = n / m;
  for (i = 0; i < n; i++) {
    for (j = 1; j <= m; j++)
      if (cnt[j] < ans1) break;
    if (j == 1 + m) break;
    if (a[i] > m) {
      ans2++;
      cnt[j]++;
      a[i] = j;
    } else if (cnt[a[i]] > ans1) {
      ans2++;
      cnt[a[i]]--;
      cnt[j]++;
      a[i] = j;
    }
    bool flag = 0;
    for (j = 1; j <= m; j++)
      if (cnt[j] < ans1) flag = 1;
    if (!flag) break;
  }
  printf("%d %d\n", ans1, ans2);
  for (i = 0; i < n; i++) printf("%d ", a[i]);
}
