#include <bits/stdc++.h>
using namespace std;
struct custom_hash {
  static uint64_t splitmix64(uint64_t x) {
    x += 0x9e3779b97f4a7c15;
    x = (x ^ (x >> 30)) * 0xbf58476d1ce4e5b9;
    x = (x ^ (x >> 27)) * 0x94d049bb133111eb;
    return x ^ (x >> 31);
  }
  size_t operator()(uint64_t x) const {
    static const uint64_t FIXED_RANDOM =
        chrono::steady_clock::now().time_since_epoch().count();
    return splitmix64(x + FIXED_RANDOM);
  }
};
bool sortbysec(const pair<long long, long long> &a,
               const pair<long long, long long> &b) {
  return (a.second < b.second);
}
long long power(long long x, unsigned long long y, long long p) {
  long long res = 1;
  x = x % p;
  if (x == 0) return 0;
  while (y > 0) {
    if (y & 1) res = (res * x) % p;
    y = y >> 1;
    x = (x * x) % p;
  }
  return res;
}
void solve() {
  long long n, m;
  cin >> n >> m;
  long long a[n];
  map<long long, long long> mp;
  for (long long i = 0; i < n; i++) {
    cin >> a[i];
    mp[a[i]]++;
  }
  long long p = 1;
  long long x = n / m, count = 0;
  for (long long i = 0; i < n; i++) {
    while (mp[p] >= x) {
      p++;
    }
    if (p > m) break;
    if (a[i] > m || mp[a[i]] > x) {
      mp[a[i]]--;
      a[i] = p;
      mp[p]++;
      count++;
    }
  }
  cout << x << " " << count << endl;
  for (long long i = 0; i < n; i++) cout << a[i] << " ";
  cout << endl;
}
int main() { solve(); }
