#include <bits/stdc++.h>
using namespace std;
const int N = 2e3 + 33, EPS = 1e5;
int owners[N];
map<int, int> cnt;
int main() {
  if (0) {
    freopen("input.in", "r", stdin);
  }
  int n, m, x;
  cin >> n >> m;
  for (int i = 1; i <= m; i++) cnt[i] = 0;
  for (int i = 0; i < n; i++) {
    scanf("%d", &x);
    owners[i] = x;
    cnt[x]++;
  }
  int ans = n / m, ans2 = 0;
  int real_owner;
  for (int i = 0; i < n; i++) {
    real_owner = owners[i];
    if (cnt[real_owner] <= ans && real_owner <= m) continue;
    if (cnt[real_owner] == 0) continue;
    for (auto k : cnt) {
      if (k.first <= m && k.second < ans) {
        owners[i] = k.first;
        cnt[k.first]++;
        cnt[real_owner]--;
        ans2++;
        break;
      }
    }
  }
  cout << ans << ' ' << ans2 << endl;
  for (int i = 0; i < n; i++) {
    printf("%d ", owners[i]);
  }
  return 0;
}
