#include <bits/stdc++.h>
using namespace std;
template <typename A, typename B>
string to_string(pair<A, B> p);
template <typename A, typename B, typename C>
string to_string(tuple<A, B, C> p);
template <typename A, typename B, typename C, typename D>
string to_string(tuple<A, B, C, D> p);
string to_string(const string& s) { return '"' + s + '"'; }
string to_string(char ch) {
  string s;
  s += ch;
  return s;
}
string to_string(const char* s) { return to_string((string)s); }
string to_string(bool b) { return (b ? "true" : "false"); }
string to_string(vector<bool> v) {
  bool first = true;
  string res = "{";
  for (int i = 0; i < static_cast<int>(v.size()); i++) {
    if (!first) {
      res += ", ";
    }
    first = false;
    res += to_string(v[i]);
  }
  res += "}";
  return res;
}
template <size_t N>
string to_string(bitset<N> v) {
  string res = "";
  for (size_t i = 0; i < N; i++) {
    res += static_cast<char>('0' + v[i]);
  }
  return res;
}
template <typename A>
string to_string(A v) {
  bool first = true;
  string res = "{";
  for (const auto& x : v) {
    if (!first) {
      res += ", ";
    }
    first = false;
    res += to_string(x);
  }
  res += "}";
  return res;
}
template <typename A, typename B>
string to_string(pair<A, B> p) {
  return "(" + to_string(p.first) + ", " + to_string(p.second) + ")";
}
template <typename A, typename B, typename C>
string to_string(tuple<A, B, C> p) {
  return "(" + to_string(get<0>(p)) + ", " + to_string(get<1>(p)) + ", " +
         to_string(get<2>(p)) + ")";
}
template <typename A, typename B, typename C, typename D>
string to_string(tuple<A, B, C, D> p) {
  return "(" + to_string(get<0>(p)) + ", " + to_string(get<1>(p)) + ", " +
         to_string(get<2>(p)) + ", " + to_string(get<3>(p)) + ")";
}
void debug_out() { cerr << endl; }
template <typename Head, typename... Tail>
void debug_out(Head H, Tail... T) {
  cerr << " " << to_string(H);
  debug_out(T...);
}
void solve() {
  int n, m;
  cin >> n >> m;
  vector<int> a(n);
  vector<int> cnt(m);
  vector<vector<int> > ids(m);
  vector<int> iter(m);
  for (int i = 0; i < n; i++) {
    cin >> a[i];
    cnt[a[i] % m]++;
    ids[a[i] % m].push_back(i);
  }
  int req = n / m;
  set<int> source, sink;
  for (int i = 0; i < m; i++) {
    if (cnt[i] > req) {
      source.insert(i);
    } else if (cnt[i] < req) {
      sink.insert(i);
    }
  }
  long long ans = 0;
  vector<int> v(n);
  42;
  for (int s : sink) {
    auto it = source.lower_bound(s);
    if (it == source.begin()) {
      it = source.end();
      it--;
    } else {
      it--;
    }
    while (cnt[s] < req) {
      42;
      while (cnt[*it] > req) {
        42;
        cnt[s]++;
        cnt[*it]--;
        ans += (s - *it + m) % m;
        int id_to_change = ids[*it][iter[*it]++];
        a[id_to_change] += (s - *it + m) % m;
        if (cnt[s] == req) {
          break;
        }
      }
      if (cnt[s] == req) {
        break;
      }
      if (cnt[*it] == req) {
        42;
        source.erase(it);
        it = source.lower_bound(s);
        if (it == source.begin()) {
          it = source.end();
          it--;
        } else {
          it--;
        }
        42;
      }
    }
  }
  cout << ans << endl;
  for (int i = 0; i < n; i++) {
    cout << a[i] << ' ';
  }
}
int main() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  cout.tie(0);
  int t = 1;
  while (t--) {
    solve();
  }
}
