#include <bits/stdc++.h>
using namespace std;
const long long inf = 1e9 + 5;
const long long INF = 1e18 + 5;
const long long maxn = 5e5 + 5;
long long n, b[555555], mx = -1000000001;
long long cnt[555555], sum, ans;
set<int> second;
pair<int, pair<int, int> > p[555555];
vector<long long> v, x, y;
map<int, int> m;
long long da[1111][1111], db[1111][1111], dc[1111][1111], dd[1111][1111],
    a[maxn], dp[maxn][3];
int main() {
  cin.tie(0);
  cout.tie(0);
  ios_base::sync_with_stdio(NULL);
  int n, c;
  cin >> n >> c;
  for (int i = 2; i <= n; i++) cin >> a[i];
  for (int i = 2; i <= n; i++) cin >> b[i];
  for (int i = 1; i <= n; i++) dp[i][1] = dp[i][2] = inf;
  dp[1][1] = dp[1][2] = 0;
  dp[1][2] = c;
  for (int i = 2; i <= n; i++) {
    dp[i][1] = min(dp[i][1], dp[i - 1][1] + a[i]);
    dp[i][1] = min(dp[i][1], dp[i - 1][2] + a[i]);
    dp[i][2] = min(dp[i][2], dp[i - 1][2] + b[i]);
    dp[i][2] = min(dp[i][2], dp[i - 1][1] + b[i] + c);
  }
  for (int i = 1; i <= n; i++) cout << min(dp[i][1], dp[i][2]) << ' ';
  return 0;
}
