#include <bits/stdc++.h>
using namespace std;
const int N = 2007;
int A[N], B[N], cnt[N], n, m;
int main() {
  scanf("%d%d", &n, &m);
  for (int i = 0; i < n; i++) {
    scanf("%d", A + i);
    if (A[i] <= m) cnt[A[i]]++;
  }
  int ans = n / m;
  int x = 0;
  for (int i = 1; i <= m; i++) {
    int j = 0;
    while (cnt[i] < ans) {
      if (A[j] > m) {
        if (B[j] == 0) x++, B[j] = i, cnt[i]++;
      } else {
        if (B[j] == 0 && cnt[A[j]] > ans) cnt[A[j]]--, x++, B[j] = i, cnt[i]++;
      }
      j++;
    }
  }
  printf("%d %d\n", ans, x);
  for (int i = 0; i < n; i++) {
    if (B[i] == 0) B[i] = A[i];
    printf("%d ", B[i]);
  }
  printf("\n");
  return 0;
}
