1 #include<bits/stdc++.h>
 2 using namespace std;
 3 typedef pair<int,int> P;
 4 typedef long long LL;
 5 const int MAX_N =2e5+9;
 6 int N,M,T,S;
 7 LL vec[MAX_N];
 8 LL res[MAX_N]; // 當前模的個數
 9 set<int> s;
10 LL out[MAX_N];
11 int main()
12 {
13     while(cin>>N>>M){
14         memset(res,0,sizeof(res));
15         memset(out,0,sizeof(out));
16         s.clear();
17         for(int i=0;i<M;i++){
18             s.insert(i);
19         }
20         for(int i=0;i<N;i++){
21             scanf("%lld",&vec[i]);
22         }
23         LL ans =0 ;
24         for(int i=0;i<N;i++){
25             LL t = vec[i]%M;
26             LL x ;
27             if(t > *s.rbegin()) x = *s.begin();
28             else x = *s.lower_bound(t);
29             res[x] ++;
30             if(res[x] == N/M) s.erase(x);
31             ans += (x - t + M)%M;
32             out[i] = (x - t + M)%M;
33         }
34         cout<<ans<<endl;
35         for(int i=0;i<N;i++){
36             printf("%lld ",vec[i] + out[i]);
37         }
38         cout<<endl;
39     }
40     return 0;
41 }