Codeforces 723 C. Polycarp at the Radio

题目链接：http://codeforces.com/problemset/problem/723/C

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.

 

题目大意：输入两个数你n、m，n是数组a[N] 的长度，m是数组b[N] 的长度，让a 数组中 > m 的数换成1~m 的数，并且使得b中最小的数达到 n / m

解析： 好坑，，比赛时一直懵逼看不懂，看了大牛博客才理解题意，其实就是暴力下；

             1： 将大于m的变了；        2：将大于n / m 的变了

             借鉴的大牛博客链接：http://blog.csdn.net/guhaiteng/article/details/52730673

代码如下：

#include<iostream>
#include<algorithm>
#include<map>
#include<stack>
#include<queue>
#include<vector>
#include<set>
#include<string>
#include<cstdio>
#include<cstring>
#include<cctype>
#include<cmath>
#define N 2009
using namespace std;
const int inf = 1e9;
const int mod = 1<<30;
const double eps = 1e-8;
const double pi = acos(-1.0);
typedef long long LL;
int a[N], b[N];

int main()
{
    int n, m, i, j;
    memset(b, 0, sizeof(b));
    scanf("%d%d", &n, &m);
    for(i = 1; i <= n; i++)
    {
        scanf("%d", &a[i]);
        if(a[i] <= m) b[a[i]]++;
    }

    int q, s;
    q = 0; s = n / m;
    for(i = 1; i <= n; i++)
    {
        if(a[i] <= m && b[a[i]] <= s) continue;
        j = 1;
        while(j <= m && b[j] >= s) j++;
        if(j > m) break;
        if(a[i] <= m) b[a[i]]--;
        q++;
        a[i] = j;
        b[j]++;
    }
    printf("%d %d\n", s, q);
    for(i = 1; i <= n; i++)
        printf("%d%c", a[i], i == n ? '\n' : ' ');
    return 0;

}