#include<bits/stdc++.h>
using namespace std;
const int kMaxN=2e5+1;
vector<int>r[kMaxN];
int a[kMaxN],n,m;
long long ans;
int main(){
	cin>>n>>m;
	for(int i=1;i<=n;i++){
		cin>>a[i];
		r[a[i]%m].push_back(i);
	} 
	for(int i=0,j=0;i<m;i++){
		while(r[i].size()>n/m){
			for(j=max(i,j);r[j%m].size()>=n/m;j++){ 
			}
			a[r[i].back()]+=j-i,ans+=j-i;
			r[j%m].push_back(r[i].back()),r[i].pop_back();
		}
	}
	cout<<ans<<endl;
	for(int i=1;i<=n;i++){
		cout<<a[i]<<' ';
	}
	return 0;	
}