#include <bits/stdc++.h>
using namespace std;
const int MOD = (int)1e9 + 7;
template <class T>
inline void rem(T &n) {
  n = (-MOD <= n && n <= MOD) ? n : n % MOD;
  if (n < 0) n += MOD;
}
template <class T>
inline T inv(T a, T m) {
  return 1 < a ? m - inv(m % a, a) * m / a : 1;
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  int n, c;
  cin >> n >> c;
  int stairs[n], lift[n], res[n];
  stairs[0] = 0, lift[0] = 0;
  for (int i = 0; i < (int)(n - 1); ++i) {
    cin >> stairs[i + 1];
  }
  for (int i = 0; i < (int)(n - 1); ++i) {
    cin >> lift[i + 1];
  }
  int dp[n + 2][2];
  memset(dp, 0, sizeof(dp));
  dp[0][1] = c;
  for (int i = (int)(1); i <= (int)(n - 1); ++i) {
    dp[i][0] = min(dp[i - 1][0], dp[i - 1][1]) + stairs[i];
    dp[i][1] = min(dp[i - 1][0] + c, dp[i - 1][1]) + lift[i];
  }
  res[0] = 0;
  for (int i = (int)(1); i <= (int)(n - 1); ++i) {
    res[i] = min(dp[i][0], dp[i][1]);
  }
  for (int i = 0; i < (int)(n); ++i) cout << res[i] << " ";
  cout << "\n";
  return 0;
}
