D. Equalize the Remainders （set的基本操作）

D. Equalize the Remainders

time limit per test

3 seconds

memory limit per test

256 megabytes

input

standard input

output

standard output

You are given an array consisting of nn integers a1,a2,…,ana1,a2,…,an, and a positive integer mm. It is guaranteed that mm is a divisor of nn.

In a single move, you can choose any position ii between 11 and nn and increase aiai by 11.

Let's calculate crcr (0≤r≤m−1)0≤r≤m−1) — the number of elements having remainder rr when divided by mm. In other words, for each remainder, let's find the number of corresponding elements in aa with that remainder.

Your task is to change the array in such a way that c0=c1=⋯=cm−1=nmc0=c1=⋯=cm−1=nm.

Find the minimum number of moves to satisfy the above requirement.

Input

The first line of input contains two integers nn and mm (1≤n≤2⋅105,1≤m≤n1≤n≤2⋅105,1≤m≤n). It is guaranteed that mm is a divisor of nn.

The second line of input contains nn integers a1,a2,…,ana1,a2,…,an (0≤ai≤1090≤ai≤109), the elements of the array.

Output

In the first line, print a single integer — the minimum number of moves required to satisfy the following condition: for each remainder from 00 to m−1m−1, the number of elements of the array having this remainder equals nmnm.

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

Examples

input

Copy

6 3
3 2 0 6 10 12

output

Copy

3
3 2 0 7 10 14 

input

Copy

4 2
0 1 2 3

output

Copy

0
0 1 2 3 

给你N个数 你可以对这些数 + 1 操作

所有数对n取模后1->m-1 每一个数都出现n/m次

求最少的操作次数

你第一次扫一遍 看看比 n/m大的 放入set里面  因为应该对超过了n/m的进行操作

 #include <bits/stdc++.h>
 using namespace std;
 typedef long long LL;
 const int maxn = 2e5 + ;
 const int INF = 0x7fffffff;
 LL n, m, num, ans, a[maxn], b[maxn];
 
 int main() {
     scanf("%lld%lld", &n, &m);
     for (int i =  ; i < n ; i++) {
         scanf("%lld", &a[i]);
         b[a[i] % m]++;
     }
     set<LL>st;
     ans = , num = n / m;
     for (int i =  ; i < m ; i++)
         if (b[i] < num)   st.insert(i);
     for (int i =  ; i < n ; i++) {
         if (b[a[i] % m] <= num) continue;
         b[a[i] % m]--;
         set<LL>::iterator it;
         it = st.lower_bound(a[i] % m);
         if (it != st.end()) {
             ans += *it - a[i] % m;
             a[i] += *it - a[i] % m;
             b[*it]++;
             if (b[*it] == num) st.erase(it);
         } else {
             LL temp = m - a[i] % m;
             ans += *st.begin() + temp;
             a[i] += *st.begin() + temp;
             b[*st.begin()]++;
             if (b[*st.begin()] == num) st.erase(st.begin());
         }
     }
     printf("%lld\n", ans);
     for (int i =  ; i < n ; i++)
         printf("%lld ", a[i]);
     printf("\n");
     return ;
 }