#include <bits/stdc++.h>
using namespace std;
namespace mak {
int xx[4] = {1, -1, 0, 0};
int yy[4] = {0, 0, 1, -1};
int xxx[8] = {1, -1, 0, 0, 1, 1, -1, -1};
int yyy[8] = {0, 0, 1, -1, 1, -1, 1, -1};
const double eps = 1e-9;
const int maxn = 2e6 + 5000;
const long long mod = 1e9 + 7;
const int INF(0x3f3f3f3f);
const long long INFL(0x3f3f3f3f3f3f3f3fll);
inline int sign(double a) { return a < -eps ? -1 : a > eps; }
template <class T>
void rd(T& x) {
  cin >> x;
}
string srd() {
  string s;
  cin >> s;
  return s;
}
void rd(int& x) { cin >> x; }
void rd(long long& x) { cin >> x; }
template <class A, class B>
void rd(A& a, B& b) {
  rd(a), rd(b);
}
template <class A, class B>
void rd(pair<A, B>& p) {
  rd(p.first, p.second);
}
long long mul(long long a, long long b, long long c) {
  long long res = 1;
  while (b) {
    if (b & 1) res *= a, res %= c;
    a *= a, a %= c, b >>= 1;
  }
  return res;
}
long long mulll(long long a, long long b, long long c) {
  long long res = 1;
  while (b) {
    if (b & 1) res *= a, res %= c;
    a *= a, a %= c, b >>= 1;
  }
  return res;
}
long long phi(long long x) {
  long long res = x;
  for (long long i = 2; i * i <= x; i++) {
    if (x % i == 0) res = res / i * (i - 1);
    while (x % i == 0) x /= i;
  }
  if (x > 1) res = res / x * (x - 1);
  return res;
}
template <typename A, typename B>
inline bool chmin(A& a, B b) {
  if (a > b) {
    a = b;
    return 1;
  }
  return 0;
}
template <typename A, typename B>
inline bool chmax(A& a, B b) {
  if (a < b) {
    a = b;
    return 1;
  }
  return 0;
}
template <typename A, typename B>
inline long long add(A x, B y) {
  if (x + y < 0) return x + y + mod;
  return x + y >= mod ? x + y - mod : x + y;
}
template <typename A, typename B>
inline void add2(A& x, B y) {
  if (x + y < 0)
    x = x + y + mod;
  else
    x = (x + y >= mod ? x + y - mod : x + y);
}
template <typename A, typename B>
inline long long mul1(A x, B y) {
  return 1ll * x * y % mod;
}
template <typename A, typename B>
inline void mul2(A& x, B y) {
  x = (1ll * x * y % mod + mod) % mod;
}
template <typename A>
inline void debug(A a) {
  cout << a << '\n';
}
template <typename A>
inline long long sqr(A x) {
  return 1ll * x * x;
}
template <typename A>
A inv(A x) {
  return mulll(x, mod - 2, mod);
}
template <typename A>
void bugl(A a[], int l, int r) {
  for (int i = l; i <= r; i++) cout << a[i] << " ";
  cout << endl;
}
template <typename A>
void bug(A a[], int l, int r) {
  for (int i = l; i <= r; i++) cout << a[i] << " ";
  cout << endl;
}
template <class T>
void wt(const T& x) {
  cout << x << endl;
}
template <class T>
void wt(const T& x, char c) {
  cout << x << c;
}
template <class T>
void wt(const T& x, const string& s) {
  cout << x << s;
}
template <class T>
void wt(const T& x, int rnd) {
  cout << fixed << setprecision(rnd) << x << endl;
}
template <class T>
void wt(const vector<T>& v) {
  for (auto d : v) cout << d << " ";
  cout << endl;
}
template <class T>
void wt(const set<T>& v) {
  for (auto d : v) cout << d << " ";
  cout << endl;
}
template <class A, class B>
void wt(const pair<A, B>& make_pair) {
  cout << make_pair.first << ' ' << make_pair.second << '\n';
}
template <class T>
inline void read(T& x) {
  x = 0;
  char c = getchar();
  int f = 1;
  while (!isdigit(c)) {
    if (c == '-') f = -1;
    c = getchar();
  }
  while (isdigit(c)) {
    x = x * 10 + c - '0';
    c = getchar();
  }
  x *= f;
}
template <class T>
void unq(std::vector<T>& v) {
  sort((v).begin(), (v).end());
  v.erase(unique((v).begin(), (v).end()), v.end());
}
template <class T>
int getid(std::vector<T>& v, const T& x) {
  return lower_bound((v).begin(), (v).end(), x) - v.begin() + 1;
}
inline bool ispal(string str) {
  int l = 0, r = ((int)str.size()) - 1;
  while (l <= r)
    if (str[l] != str[r])
      return false;
    else
      l++, r--;
  return true;
}
inline bool isdigit(char c) {
  if (c <= '9' && c >= '0') return true;
  return false;
}
inline bool islower(char c) {
  if (c <= 'z' && c >= 'a') return true;
  return false;
}
inline bool isupper(char c) {
  if (c <= 'Z' && c >= 'A') return true;
  return false;
}
inline long long changenum(string str) {
  long long res = 0;
  for (register int i = (0); i <= (((int)str.size()) - 1); i++) {
    res *= 10;
    res += (str[i] - '0');
  }
  return res;
}
inline void changstr(long long x, string& str) {
  str = "";
  while (x) str += (x % 10ll + '0'), x /= 10;
  reverse((str).begin(), (str).end());
}
inline void addstr_(string& str) {
  string s = " ";
  s += str;
  str = s;
}
inline long long upd(long long a, long long b) {
  return a % b ? a / b + 1 : a / b;
}
inline long long lowbit(long long x) { return (x & (-x)); }
inline void debug() { cout << "###!!!" << endl; }
}  // namespace mak
using namespace mak;
long long n, k;
long long a[maxn], m;
long long pre[maxn];
int main() {
  ios::sync_with_stdio(false);
  ;
  cin >> n >> m;
  for (register int i = (0); i <= (n - 1); i++) cin >> a[i];
  sort((a + 0), (a + n - 1 + 1));
  long long ans = 0;
  for (int i = 0; i < n; i++) {
    pre[i % m] += a[i];
    ans += pre[i % m];
    cout << ans << " ";
  }
  cout << endl;
  return 0;
}
