CF999D.Equalize the Remainders

The first line of input contains two integers $n$ and $m$ ( $1 \le n \le 2 \cdot 10^5, 1 \le m \le n$ ). It is guaranteed that $m$ is a divisor of $n$ .

The second line of input contains $n$ integers $a_1, a_2, \dots, a_n$ ( $0 \le a_i \le 10^9$ ), the elements of the array.

In the first line, print a single integer — the minimum number of moves required to satisfy the following condition: for each remainder from $0$ to $m - 1$ , the number of elements of the array having this remainder equals $\frac{n}{m}$ .

In the second line, print any array satisfying the condition and can be obtained from the given array with the minimum number of moves. The values of the elements of the resulting array must not exceed $10^{18}$ .

无