#include <bits/stdc++.h>
using namespace std;
int n, c, b[200123], a[200123], dp[200123][2];
int solve(int i, int el) {
  if (i == 1) return 0;
  int& ans = dp[i][el];
  if (~ans) return ans;
  if (el) {
    ans = min(solve(i - 1, el) + b[i], solve(i - 1, 0) + a[i]);
  } else {
    ans = min(solve(i - 1, el) + a[i], solve(i - 1, 1) + b[i] + c);
  }
  return ans;
}
int main() {
  cin >> n >> c;
  for (int i = 2; i <= n; ++i) {
    cin >> a[i];
  }
  for (int i = 2; i <= n; ++i) {
    cin >> b[i];
  }
  memset(dp, -1, sizeof dp);
  for (int i = 1; i <= n; ++i) {
    cout << solve(i, 0) << ' ';
  }
  cout << endl;
  return 0;
}
