Codeforces Round#375 C: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 21 2 3 2

output

2 11 2 1 2 

input

7 31 3 2 2 2 2 1

output

2 11 3 3 2 2 2 1 

input

4 41000000000 100 7 1000000000

output

1 41 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.

题意：

给出一个长度为n的歌单，每首歌由歌单对应的队伍演出，但是你只喜欢前m个（1,2....m）队伍，现在改变歌单使得你喜欢的演出最少的队伍尽量大，求需要修改几次，并输出方案。

题解：

容易看出每个乐队演出n/m首歌，故以此为最小值进行维护。

#include <cstdio>  #include <cstring>  #include <string>#include <cmath>  #include <cstdlib>  #include <algorithm>  #include <queue>    #include <map>  #include <vector>  #include <iostream>#define INF 0x3f3f3f3f  #define mst(a, b) memset(a, (b), sizeof(a))  #define MOD 100000007  #define ll long long  #define lson node<<1, l, mid  #define rson node<<1|1, mid+1, r  const  int maxn = 50005;using namespace std;int n, m;int a[2005],vis[2005],cnt[2005];int ans2 = 0;int main() {cin >> n >> m;for(int i=1;i<=n;i++){cin >> a[i];}int ans1 = n / m ;for(int i=1;i<=n;i++) {if (a[i] > m) continue;if (cnt[a[i]] >= ans1) continue;cnt[a[i]]++;vis[i]=1 ;}for(int i=1;i<=n;i++){if (vis[i])continue;int minm = 1e9, posi = 1e9;for(int j=1;j<=m;j++)if (cnt[j] < minm)minm = cnt[j], posi = j;if (minm == ans1) continue;ans2++;cnt[posi]++,a[i] = posi;}cout << ans1 << " " << ans2 << endl;bool flag = 0;for(int i=1;i<=n;i++){if (flag) {cout << " ";}flag = 1;cout << a[i];}cout << endl;}