#include <bits/stdc++.h>
using namespace std;
int n, k, Count = 0, a[2005], Free[2005];
vector<int> V;
int main() {
  cin >> n >> k;
  for (int i = 1; i <= n; i++) {
    cin >> a[i];
    if (a[i] <= k)
      Free[a[i]]++;
    else
      V.push_back(i);
  }
  for (int i = 1; i <= k; i++)
    while (V.size() > 0 && Free[i] < n / k) {
      Free[i]++;
      Count++;
      a[V.back()] = i;
      V.pop_back();
    }
  for (int i = 1; i <= k; i++)
    if (Free[i] < n / k) {
      for (int j = 1; j <= n; j++)
        if (Free[a[j]] > n / k) {
          Free[a[j]]--;
          Free[i]++;
          Count++;
          a[j] = i;
          if (Free[i] == n / k) break;
        }
    }
  cout << n / k << ' ' << Count << "\n";
  for (int i = 1; i <= n; i++) cout << a[i] << ' ';
}
