#include <bits/stdc++.h>
using namespace std;
bool DD = 0;
namespace mine {
long long qread() {
  long long ans = 0, f = 1;
  char c = getchar();
  while (c < '0' or c > '9') {
    if (c == '-') f = -1;
    c = getchar();
  }
  while ('0' <= c and c <= '9') ans = ans * 10 + c - '0', c = getchar();
  return ans * f;
}
void write(long long num) {
  if (num < 0) putchar('-'), num = -num;
  if (num >= 10) write(num / 10);
  putchar('0' + num % 10);
}
void write1(long long num) {
  write(num);
  putchar(' ');
}
void write2(long long num) {
  write(num);
  putchar('\n');
}
template <typename T>
inline bool chmax(T &a, const T &b) {
  return a < b ? a = b, 1 : 0;
}
template <typename T>
inline bool chmin(T &a, const T &b) {
  return a > b ? a = b, 1 : 0;
}
long long gcd(long long x, long long y) { return y ? gcd(y, x % y) : x; }
bool IN(long long x, long long l, long long r) { return l <= x and x <= r; }
const int INF = 0x3f3f3f3f;
const int MOD = 1e9 + 7;
int mm(const int x) { return x >= MOD ? x - MOD : x; }
template <typename T>
void add(T &x, const int &y) {
  x = (x + y >= MOD ? x + y - MOD : x + y);
}
long long qpower(long long x, long long e, int mod = MOD) {
  long long ans = 1;
  while (e) {
    if (e & 1) ans = ans * x % mod;
    x = x * x % mod;
    e >>= 1;
  }
  return ans;
}
long long invm(long long x) { return qpower(x, MOD - 2); }
const int N = 1e6 + 10;
deque<int> que;
priority_queue<pair<long long, long long>, vector<pair<long long, long long> >,
               greater<pair<long long, long long> > >
    sit;
priority_queue<int, vector<int>, greater<int> > wt;
long long ans[N];
void upd() {
  if (((int)(wt).size()))
    if (!((int)(que).size()) or wt.top() < que.back())
      que.push_back(wt.top()), wt.pop();
}
void main() {
  int n = qread();
  long long P = qread();
  for (int i = (1), I = (n); i <= I; i++) sit.push({qread(), i});
  long long time = 0;
  while (1) {
    if (((int)(que).size())) {
      int id = que.front();
      time += P, ans[id] = time;
      while (((int)(sit).size()) and sit.top().first < time)
        wt.push(sit.top().second), sit.pop(), upd();
      que.pop_front();
    } else if (((int)(wt).size()))
      ;
    else if (!((int)(wt).size()) and ((int)(sit).size()))
      time = sit.top().first;
    else
      break;
    while (((int)(sit).size()) and sit.top().first <= time)
      wt.push(sit.top().second), sit.pop(), upd();
    upd();
  }
  for (int i = (1), I = (n); i <= I; i++) write1(ans[i]);
}
};  // namespace mine
signed main() {
  srand(time(0));
  mine::main();
}
