#include <iostream>
#include <vector>
#include <climits>
#include <algorithm>
#include <cmath>
#include <map>
#include <set>
#include <string>
#include <bitset>
#include <utility>
#include <numeric>
#include <queue>
#include <stack>

using ll = long long;
using namespace std;

constexpr int MOD = 1e9 + 7;
constexpr ll MOD_LL = ll(1e9 + 7);

int main(void) {
	int n, h;
	cin >> n >> h;
	
	vector<int> t(n);
	for(int i = 0; i < n; ++i) {
		cin >> t[i];
		t[i] += h;
	}
	
	for(int i = 0; i < n; ++i) {
		cout << t[i];
		
		if( i < n - 1 ) cout << " ";
	}
	
	cout << endl;
	
	return 0;
}