#include <bits/stdc++.h>
using namespace std;
int main() {
  int n, m;
  scanf("%d%d", &n, &m);
  int i, j;
  vector<int> play(n);
  int perVal = n / m;
  vector<int> countVal(m + 1, 0);
  for (i = 0; i < n; i++) {
    scanf("%d", &play[i]);
    if (play[i] <= m) {
      countVal[play[i]]++;
    }
  }
  int changes = 0;
  for (i = 1; i <= m; i++) {
    if (countVal[i] < perVal) {
      int req = perVal - countVal[i];
      changes += req;
      for (j = 0; j < n && req > 0; j++) {
        int val = play[j];
        if (val <= m && (countVal[val] > perVal)) {
          countVal[val]--;
          req--;
          play[j] = i;
        } else if (val > m) {
          play[j] = i;
          req--;
        }
      }
    }
  }
  printf("%d %d\n", perVal, changes);
  for (int v : play) {
    printf("%d ", v);
  }
  return 0;
}
