#include <bits/stdc++.h>
#pragma GCC optimize("Ofast")
using namespace std;
long long n, c, a[200007], b[200007], dp[2][200007];
int main() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  cout.tie(0);
  ;
  cin >> n >> c;
  for (long int i = 1; i < n; i++) cin >> a[i];
  for (long int i = 1; i < n; i++) cin >> b[i];
  dp[0][0] = 0;
  dp[1][0] = c;
  for (long int i = 1; i < n; i++) {
    dp[0][i] = min(dp[0][i - 1] + a[i], dp[1][i - 1] + a[i]);
    dp[1][i] = min(dp[0][i - 1] + c + b[i], dp[1][i - 1] + b[i]);
  }
  for (long int i = 0; i < n; i++) {
    cout << min(dp[0][i], dp[1][i]) << " ";
  }
}
