#include <bits/stdc++.h>
using namespace std;
const int INF = 0x3f3f3f3f;
const long long LL_INF = 1LL << 62;
const int maxn = 2000 + 10;
const int mod = 1e9 + 7;
int a[maxn];
map<int, int> mp;
queue<int> que;
int main() {
  int n, m;
  scanf("%d%d", &n, &m);
  for (int i = 0; i < n; i++) {
    scanf("%d", &a[i]);
    if (a[i] > m)
      mp[a[i]] = INF;
    else
      mp[a[i]]++;
  }
  int minn = n / m, cnt = 0;
  int tmp;
  for (int i = 1; i <= m; i++) {
    if (mp[i] < minn) {
      tmp = minn - mp[i];
      cnt += tmp;
      while (tmp--) {
        que.push(i);
      }
    }
  }
  for (int i = 0; i < n; i++) {
    if (!que.empty()) {
      if (mp[a[i]] > minn) {
        mp[a[i]]--;
        tmp = que.front();
        que.pop();
        a[i] = tmp;
      }
    }
  }
  printf("%d %d\n", minn, cnt);
  for (int i = 0; i < n; i++) printf("%d%c", a[i], " \n"[i == n - 1]);
}
