#include <iostream>
#include <vector>
#include <string>
#include <iomanip>
#include <queue>
#include <cmath>
#include <algorithm>
#include <tuple>
#include <iomanip>
#include <stdio.h>
#include <numeric>
#include <map>
#include <bitset>
#include <set>
#include <stack>
#include <queue>
#include <unordered_set>


//#pragma GCC optimize("Ofast,no-stack-protector")
//#pragma GCC optimize("O3")
//#pragma GCC target("avx2")
//#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,avx2,tune=native")
//#pragma GCC optimize("unroll-loops")
//#pragma GCC optimize("fast-math")
//#pragma GCC optimize("section-anchors")
//#pragma GCC optimize("profile-values,profile-reorder-functions,tracer")
//#pragma GCC optimize("vpt")
//#pragma GCC optimize("rename-registers")
//#pragma GCC optimize("move-loop-invariants")
//#pragma GCC optimize("unswitch-loops")
//#pragma GCC optimize("function-sections")
//#pragma GCC optimize("data-sections")
//#pragma GCC optimize("branch-target-load-optimize")
//#pragma GCC optimize("branch-target-load-optimize2")
//#pragma GCC optimize("btr-bb-exclusive")
//#pragma GCC optimize("O0")


#define int long long
#define ll long long
#define ull unsigned long long
#define all(a) a.begin(), a.end()
#define pii pair<int, int>
#define pb push_back
#define ld long double


using namespace std;

const int INF = 1e17;
//const int mod = 2600000069;
//const int p = 179;

int n, p;
vector<int> a, t;

void build(int v, int l, int r) {
    if (r - l == 1) {
        t[v] = a[l];
        return;
    }
    int m = (l + r) / 2;
    build(2 * v + 1, l, m);
    build(2 * v + 2, m, r);
    t[v] = min(t[2 * v + 1], t[2 * v + 2]);
}

void update(int v, int l, int r, int pos) {
    if (r - l == 1) {t[v] = INF; return;}
    int m = (l + r ) / 2;
    if (pos < m) update(2 * v + 1, l, m, pos);
    else update(2 * v + 2, m, r, pos);
    t[v] = min(t[2  *v + 1], t[2 * v + 2]);
}

int tim = INF;

int get_pos(int v, int l, int r) {
    if (r - l == 1) {
        return l;
    }
    int m = (l + r ) / 2;
    if (t[2 *  v + 1] <= tim) return get_pos(2 * v + 1, l, m);
    else return get_pos(2 * v + 2, m, r);
}

signed main() {
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
    int n;
    cin >> n >> p;
    a.resize(n);
    t.resize(4 * n);
    for (int i = 0; i < n; i++) {cin >>a[i]; tim = min(tim, a[i]);}
    build(0, 0, n);
    int cur;
    vector<int> ans(n);
    while(t[0] != INF) {
        cur = get_pos(0, 0, n);
        ans[cur] = max(tim + p, a[cur] + p);
        tim = ans[cur];
        update(0, 0, n, cur);
        tim = max(tim, t[0]);
    }
    for (auto k : ans) cout << k << " ";
}