codeforces723C 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.

题干真TM难懂……a里面的元素是乐队的编号，a反映的是乐队出场次数和顺序（顺序不重要，关键是次数），也就是说一个编号在a里面出现了多少次，它就上场了多少次，b[x] = y的意思是Polycarp喜欢的乐队x出场y次，这里x是他超喜欢的乐队的名字的编号，他想要改变a使他喜欢的乐队中出演的最少次数最大，也就是说每个b[i] >= per，这个per尽可能大，什么时候per最大，当然是均值n / m的时候

有一个注意的地方就是例如：

7 3

1 3 2 4 2 2 1

7 / 3 = 2，到底是把4变成3还是把一个2变成3，其实无所谓，最后min(b[1], b[2], b[3])都是等于2，虽然把4变成3确实使喜欢的乐队总数多，但是题目要求的是最少的出场次数最大，并不是总体数目尽量多，还有就是比如变一个2为3，则成为1 3 3 4 2 2 1，还有没有必要继续变4为1，2，3其中之一？没必要，因为就算变了，min(b[1], b[2], b[3])还是为2，还白白多加了一次变换次数，题目要求出场次数最小值尽可能大的同时，还要求改变次数尽可能小

#include <cstdio>
#include <iostream>
#include <algorithm>
#include <map>

using namespace std;

int n, m, per, cnt;
int a[2005];
map<int, int> mp;

int main()
{
	cin >> n >> m;
	per = n / m;
	mp.clear();
	for (int i = 1; i <= m; i++) {
		mp[i] = 0;
	}
	for (int i = 0; i < n; i++) {
		scanf("%d", &a[i]);
		if (a[i] >= 1 && a[i] <= m) {
			mp[a[i]]++;
		}
	}
	printf("%d ", per);
	cnt = 0;
	for (map<int, int>::iterator i = mp.begin(); i != mp.end(); i++) {
		if (i->second < per) {
			for (int j = 0; j < n; j++) {
				if (a[j] > m || a[j] < 1) {
					a[j] = i->first;
					i->second++;
					cnt++;
				}
				else if (mp[a[j]] > per) {
					mp[a[j]]--;
					i->second++;
					a[j] = i->first;
					cnt++;
				}
				if (i->second >= per) break;
			}
		}
	}
	printf("%d\n", cnt);
	for (int i = 0; i < n; i++) {
		printf(i == 0 ? "%d" : " %d", a[i]);
	}
	puts("");
	return 0;
}