#include <bits/stdc++.h>
using namespace std;
const double eps = 1e-8;
const int mod = 1000000007;
const double PI = acos(-1.0);
struct node {
  int x, id;
} a[2005];
int b[2005];
int c[2005];
char s[2005];
bool vis[2005];
int n, m;
int ans;
bool cmp(node a, node b) { return a.x < b.x; }
int main() {
  int tt, ca = 1;
  int p, q;
  scanf("%d %d", &n, &m);
  ans = n / m;
  int res = n % m;
  int num = 0;
  for (int i = 0; i < n; i++) {
    scanf("%d", &a[i].x);
    a[i].id = i;
    if (a[i].x <= m) {
      if (b[a[i].x] < ans)
        b[a[i].x]++;
      else if (res > 0)
        res--;
      else
        c[num++] = i;
    } else
      c[num++] = i;
  }
  int j = 0;
  int cnt = 0;
  for (int i = 1; i <= m; i++) {
    while (b[i] < ans) {
      b[i]++;
      a[c[j++]].x = i;
      cnt++;
    }
  }
  printf("%d %d\n", ans, cnt);
  for (int i = 0; i < n; i++) printf("%d ", a[i].x);
  return 0;
}
