#include <bits/stdc++.h>
using namespace std;
const int MAXN = 2010;
int n, m;
int data[MAXN];
map<int, int> tub;
int main() {
  cin >> n >> m;
  for (int i = 1; i <= n; i++) {
    cin >> data[i];
    tub[data[i]]++;
  }
  int ans = n / m, cnt = 0;
  int comp = 1;
  for (int i = 1; i <= n; i++) {
    while (comp <= m && tub[comp] >= ans) {
      comp++;
    }
    if (comp > m) {
      break;
    }
    if (data[i] > m || tub[data[i]] > ans) {
      tub[data[i]]--;
      tub[comp]++;
      data[i] = comp;
      cnt++;
    }
  }
  cout << ans << " " << cnt << endl;
  for (int i = 1; i <= n; i++) {
    cout << data[i] << " ";
  }
  cout << endl;
}
