#include <bits/stdc++.h>
using namespace std;
inline int in() {
  int x;
  cin >> x;
  return x;
}
const int N = 2002;
int main() {
  int n = in();
  int m = in();
  int a[N];
  vector<int> can;
  vector<int> pos[N];
  int k = n / m;
  for (int i = 1; i <= n; i++) {
    int x = in();
    a[i] = x;
    if (x > m)
      can.push_back(i);
    else if ((int)pos[x].size() != k)
      pos[x].push_back(i);
    else
      can.push_back(i);
  }
  int ans = 0;
  for (int i = 1; i <= m; i++)
    while ((int)pos[i].size() != k) {
      int x = can.back();
      can.pop_back();
      pos[i].push_back(x);
      a[x] = i;
      ans++;
    }
  cout << k << ' ' << ans << endl;
  for (int i = 1; i <= n; i++) cout << a[i] << ' ';
  cout << endl;
}
