#include <bits/stdc++.h>
using namespace std;
long long dp[200005][2];
long long a[200005], b[200005];
void solve() {
  long long n, c;
  cin >> n >> c;
  for (int i = 0; i < n - 1; i++) cin >> a[i];
  ;
  for (int i = 0; i < n - 1; i++) cin >> b[i];
  ;
  dp[1][1] = c;
  for (int i = 2; i < n + 1; i++) {
    dp[i][0] = min(dp[i - 1][0], dp[i - 1][1]) + a[i - 2];
    dp[i][1] = min(dp[i - 1][0] + c + b[i - 2], dp[i - 1][1] + b[i - 2]);
  }
  for (int i = 1; i < n + 1; i++) cout << min(dp[i][0], dp[i][1]) << " ";
  cout << '\n';
}
int main() {
  int t = 1;
  while (t--) {
    solve();
  }
  return 0;
}
