#include <bits/stdc++.h>
using namespace std;
template <typename T>
inline void gn(T &x) {
  x = 0;
  T f = 1;
  char ch = getchar();
  while (!isdigit(ch)) {
    if (ch == '-') f = -1;
    ch = getchar();
  }
  while (isdigit(ch)) {
    x = x * 10 + ch - '0';
    ch = getchar();
  }
  x *= f;
}
template <typename T>
inline void gt(T x) {
  if (!x) return;
  gt(x / 10);
  putchar(x % 10 + '0');
}
const long long MAXN = 2e3 + 5;
long long t, n, m, p, ans;
long long MOD = 1e9 + 7, inf = 0x1f1f1f1f;
double eps = 1e-5;
long long f[MAXN], vis[MAXN], num[MAXN];
queue<long long> q;
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(0);
  long long i, j, k, l, ca = 0;
  cin >> n >> m;
  t = n / m;
  p = n % m;
  for (i = 1; i <= n; i++) {
    cin >> f[i];
    if (f[i] > 0 && f[i] <= m) {
      if (num[f[i]] < t)
        vis[i]++, num[f[i]]++;
      else if (num[f[i]] >= t && p > 0)
        vis[i]++, num[f[i]]++, p--;
    }
  }
  for (i = 1; i <= m; i++) {
    if (num[i] < t)
      for (j = num[i] + 1; j <= t; j++) q.push(i);
  }
  for (i = 1; i <= n; i++) {
    if (q.empty()) break;
    if (!vis[i]) f[i] = q.front(), q.pop(), ans++;
  }
  cout << t << " " << ans << endl;
  for (i = 1; i <= n; i++) cout << f[i] << " ";
  return 0;
}
