#include <bits/stdc++.h>
using namespace std;
const int N = 2e5 + 5;
const int inf = 2e9 + 5;
const long long OO = 1e18;
const long long MOD = 1e9 + 7;
int n, c, a[2][N], dp[N][3];
int main() {
  cin >> n >> c;
  for (int i = 0; i < n - 1; i++) cin >> a[0][i];
  for (int i = 0; i < n - 1; i++) cin >> a[1][i];
  dp[0][0] = dp[0][1] = 0;
  for (int i = 1; i <= n - 1; i++) {
    dp[i][0] = min(dp[i - 1][0], dp[i - 1][1]) + a[0][i - 1];
    dp[i][1] = min(dp[i - 1][0] + c, i > 1 ? dp[i - 1][1] : inf) + a[1][i - 1];
  }
  for (int i = 0; i < n; i++) cout << min(dp[i][0], dp[i][1]) << " ";
  cout << "\n";
}
