#include <bits/stdc++.h>
const double PI =
    3.141592653589793238462643383279502884197169399375105820974944;
using namespace std;
long long ModExp(long long x, long long y, long long m) {
  long long res = 1;
  x = x % m;
  while (y > 0) {
    if (y & 1) res = (res * x) % m;
    y = y >> 1;
    x = (x * x) % m;
  }
  return res;
}
void solve() {
  long long n, c;
  cin >> n >> c;
  long long a[n];
  for (long long i = 1; i < n; i++) {
    cin >> a[i];
  }
  long long b[n];
  for (long long i = 1; i < n; i++) {
    cin >> b[i];
  }
  long long dp[n][2];
  dp[1][0] = 0;
  dp[1][1] = c;
  for (long long i = 2; i < n + 1; i++) {
    dp[i][0] = min(dp[i - 1][0] + a[i - 1], dp[i - 1][1] + a[i - 1]);
    dp[i][1] = min(dp[i - 1][0] + c + b[i - 1], dp[i - 1][1] + b[i - 1]);
  }
  for (long long i = 1; i < n + 1; i++) {
    cout << min(dp[i][0], dp[i][1]) << " ";
  }
  cout << endl;
}
signed main() {
  ios_base::sync_with_stdio(false);
  cin.tie(0);
  cout.tie(0);
  ;
  long long t = 1;
  while (t--) {
    solve();
  }
}
