#include <bits/stdc++.h>
using namespace std;
int32_t main() {
  long long n, m;
  cin >> n >> m;
  vector<long long> pup;
  vector<long long> a(n);
  vector<long long> bo[m + 1];
  for (long long i = 0; i < n; ++i) {
    cin >> a[i];
    if (a[i] <= m) {
      bo[a[i]].push_back(i);
    } else {
      pup.push_back(i);
    }
  }
  long long ans1 = n / m, ans2 = 0;
  long long ind = 1, maxi = 1;
  for (long long i = 1; i <= m; ++i) {
    if (bo[ind].size() > bo[i].size()) ind = i;
    if (bo[maxi].size() < bo[i].size()) maxi = i;
  }
  while (bo[ind].size() < ans1) {
    if (!pup.empty()) {
      a[pup[pup.size() - 1]] = ind;
      bo[ind].push_back(pup[pup.size() - 1]);
      pup.pop_back();
      ans2++;
    } else {
      a[bo[maxi][bo[maxi].size() - 1]] = ind;
      bo[ind].push_back(bo[maxi][bo[maxi].size() - 1]);
      bo[maxi].pop_back();
      ans2++;
    }
    ind = 1, maxi = 1;
    for (long long i = 1; i <= m; ++i) {
      if (bo[ind].size() > bo[i].size()) ind = i;
      if (bo[maxi].size() < bo[i].size()) maxi = i;
    }
  }
  cout << ans1 << ' ' << ans2 << endl;
  for (long long i = 0; i < n && (cout << a[i] << ' '); ++i)
    ;
  return 0;
}
