CF723C. Polycarp at the Radio[]

C. Polycarp at the Radio

time limit per test

2 seconds

memory limit per test

256 megabytes

input

standard input

output

standard output

Polycarp is a music editor at the radio station. He received a playlist for tomorrow, that can be represented as a sequence a1, a2, ..., an, where ai is a band, which performs the i-th song. Polycarp likes bands with the numbers from 1 to m, but he doesn't really like others.

We define as bj the number of songs the group j is going to perform tomorrow. Polycarp wants to change the playlist in such a way that the minimum among the numbers b1, b2, ..., bm will be as large as possible.

Find this maximum possible value of the minimum among the bj (1 ≤ j ≤ m), and the minimum number of changes in the playlist Polycarp needs to make to achieve it. One change in the playlist is a replacement of the performer of the i-th song with any other group.

Input

The first line of the input contains two integers n and m (1 ≤ m ≤ n ≤ 2000).

The second line contains n integers a1, a2, ..., an (1 ≤ ai ≤ 109), where ai is the performer of the i-th song.

Output

In the first line print two integers: the maximum possible value of the minimum among the bj (1 ≤ j ≤ m), where bj is the number of songs in the changed playlist performed by the j-th band, and the minimum number of changes in the playlist Polycarp needs to make.

In the second line print the changed playlist.

If there are multiple answers, print any of them.

Examples

input

4 2
1 2 3 2

output

2 1
1 2 1 2 

input

7 3
1 3 2 2 2 2 1

output

2 1
1 3 3 2 2 2 1 

input

4 4
1000000000 100 7 1000000000

output

1 4
1 2 3 4 

Note

In the first sample, after Polycarp's changes the first band performs two songs (b1 = 2), and the second band also performs two songs (b2 = 2). Thus, the minimum of these values equals to 2. It is impossible to achieve a higher minimum value by any changes in the playlist.

In the second sample, after Polycarp's changes the first band performs two songs (b1 = 2), the second band performs three songs (b2 = 3), and the third band also performs two songs (b3 = 2). Thus, the best minimum value is 2.

---

题意：让1到m出现次数最少的最多，修改次数最小

---

 

坑人啊最后被人hack了瞎改了一通又改错了呜呜呜

最多n/m次

可以把少的加到一个栈里，输出时遇到可以替换的就换成栈里的

没必要用map，大于m的没必要记录出现次数

#include <iostream>
#include <cstdio>
#include <algorithm>
#include <cstring>
#include <map>
using namespace std;
typedef long long ll;
const int N=2005;
inline int read(){
    char c=getchar();int x=0,f=1;
    while(c<'0'||c>'9'){if(c=='-')f=-1;c=getchar();}
    while(c>='0'&&c<='9'){x=x*10+c-'0';c=getchar();}
    return x;
}
int n,m,a[N],b[N],res=0;
int st[N],top=0;
int main(){
    n=read();m=read();
    for(int i=1;i<=n;i++){
        a[i]=read();
        if(a[i]<=m) b[a[i]]++;
        else res++;
    }
    int t=n/m,ans=0;
    for(int i=1;i<=m;i++)
        if(b[i]<t){
            int tmp=t-b[i];
            while(tmp-->0){st[++top]=i;ans++;}
        }
    printf("%d %d\n",t,ans);
    for(int i=1;i<=n;i++){
        if(top!=0&&(a[i]>m||b[a[i]]>t)){
            if(a[i]>m) printf("%d ",st[top--]);
            else if(b[a[i]]>t) {printf("%d ",st[top--]);b[a[i]]--;}
            //if(a[i]==3)printf(" hi%dhi ",b[3]);
        }
        else printf("%d ",a[i]);
    }
}