#include <bits/stdc++.h>
using namespace std;
#define int              long long int
#define double           long double
#define print(a)         for(auto x : a) cout << x << " "; cout << endl


const int M = 1000000007;
const int N = 3e5+9;
const int INF = 2e9+1;
const int LINF = 2000000000000000001;

inline int power(int a, int b) {
    int x = 1;
    a %= M;
    while (b) {
        if (b & 1) x = (x * a) % M; 
        a = (a * a) % M;
        b >>= 1;
    }
    return x;
}


//_ ***************************** START Below *******************************




vector<int> a;

vector<vector<int>> consistency(int n, int m){

    vector<int> freq(m + 1, 0);
    vector<int> ans(a);

    for (int i = 0; i < n; i++) {
        if (a[i] <= m) {
            freq[a[i]]++;
        }
    }

    int target = n / m;

    vector<int> mark;
    for(int i=0; i<n; i++){
        if(a[i]>m) mark.push_back(i);
        else {
            if(freq[a[i]] > target){
                mark.push_back(i);
                freq[a[i]]--;
            }
        }
    }


    int changes = 0;

    for (int i = 1; i <= m; i++) {
        while(freq[i] < target){
            int j = mark.back();
            mark.pop_back();

            ans[j] = i;
            freq[i]++;

            changes++;
        }
    }

    return {{target, changes}, ans};

}









vector<vector<int>> practice(int n, int m){


    return {};
}





void solve() {
    
    int n, m;
    cin>> n >> m;
    
    a.resize(n);
    for(int i=0; i<n; i++) cin >> a[i];
    
    auto ans = consistency(n, m);

    cout << ans[0][0] << " " << ans[0][1] << endl;
    for(auto& it : ans[1]){
        cout << it << " ";
    }cout << endl;


}





int32_t main() {
    ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);

    int t = 1;
    // cin >> t;
    while (t--) {
        solve();
    }

    return 0;
}