#include<iostream> #include<string> #include<algorithm> #include<vector> #include<queue> #include<map> #include<math.h> #include<iomanip> #include<set> #include<numeric> #include<cstring> #include<cstdio> #include<functional> #include<bitset> #include<limits.h> #include<cassert> #include<iterator> #include<complex> #include<stack> #include<sstream> #include<iterator> #include<list> using namespace std; typedef long long int lint; #define rep(i, n) for (lint i = 0; i < n; i++) #define sort(v) sort((v).begin(), (v).end()) #define reverse(v) reverse((v).begin(), (v).end()) #define upper(v,hoge) upper_bound(v.begin(),v.end(),hoge) #define lower(v,hoge) lower_bound(v.begin(),v.end(),hoge) #define mp make_pair #define enld endl #define P pair<lint,lint> int main() { lint N, H; cin >> N >> H; vector<lint>T(N); rep(i, N) { cin >> T[i]; } rep(i, N) { T[i] += H; } rep(i, N) { cout << T[i]; if (i == N - 1) { cout << enld; } else { cout << ' '; } } }