#include <bits/stdc++.h>
using namespace std;
int a[2001];
int b[2001];
int c[2001];
int main() {
  int n, m;
  while (cin >> n >> m) {
    memset(a, 0, sizeof(a));
    memset(b, 0, sizeof(b));
    memset(c, 0, sizeof(c));
    int lest = 0;
    for (int i = 1; i <= n; i++) {
      scanf("%d", &a[i]);
      if (a[i] <= m) b[a[i]]++;
    }
    int t = n / m;
    int ans = 0;
    int ge = 0;
    for (int i = 1; i <= m; i++) {
      if (b[i] < t) {
        int sum = t - b[i];
        while (sum) {
          c[++ge] = i;
          ans++;
          sum--;
        }
      }
    }
    printf("%d %d\n", t, ans);
    for (int i = 1; i <= n; i++) {
      if (ge != 0 && (a[i] > m || b[a[i]] > t)) {
        if (a[i] > m) {
          printf("%d ", c[ge--]);
        } else if (b[a[i]] > t) {
          printf("%d ", c[ge--]);
          b[a[i]]--;
        }
      } else
        printf("%d ", a[i]);
    }
    cout << endl;
  }
}
