#include <bits/stdc++.h>
using namespace std;
const int maxn = 2000 + 50;
const int maxm = 1e6 + 50;
const double eps = 1e-10;
const int max_index = 26;
const int inf = 0x3f3f3f3f;
const int MOD = 1e9 + 7;
const double PI = acos(-1.);
inline int read() {
  char c = getchar();
  while (!isdigit(c)) c = getchar();
  int x = 0;
  while (isdigit(c)) {
    x = x * 10 + c - '0';
    c = getchar();
  }
  return x;
}
int a[maxn];
int num[maxn];
int vis[maxn];
int main() {
  int n, m;
  cin >> n >> m;
  queue<int> q;
  for (int i = 1; i <= n; i++) cin >> a[i];
  int ans = n / m, rest = n % m;
  for (int i = 1; i <= n; i++) {
    if (a[i] <= m) num[a[i]]++;
  }
  int cnt = 0;
  for (int i = 1; i <= n; i++) {
    if (a[i] > m || num[a[i]] > ans) {
      int id = min(a[i], m);
      for (int j = 1; j <= m; j++)
        if (num[j] < num[id]) id = j;
      if (num[id] < ans) {
        if (a[i] <= m) num[a[i]]--;
        a[i] = id;
        cnt++;
        num[id]++;
      }
    }
  }
  cout << ans << " " << cnt << "\n";
  for (int i = 1; i <= n; i++) cout << a[i] << " ";
  return 0;
}
