#include <bits/stdc++.h>
using namespace std;
int main() {
  long long int n, k;
  cin >> n >> k;
  vector<long long int> a, b;
  for (long long int i = 0; i < n - 1; i++) {
    long long int x;
    cin >> x;
    a.push_back(x);
  }
  for (long long int i = 0; i < n - 1; i++) {
    long long int y;
    cin >> y;
    b.push_back(y);
  }
  vector<vector<long long int>> dp(n + 1, vector<long long int>(2, INT_MAX));
  dp[0][1] = k;
  dp[0][0] = 0;
  for (long long int i = 0; i <= n - 2; i++) {
    dp[i + 1][0] = min(dp[i + 1][0], dp[i][0] + a[i]);
    dp[i + 1][0] = min(dp[i + 1][0], dp[i][1] + a[i]);
    dp[i + 1][1] = min(dp[i + 1][1], dp[i][0] + b[i] + k);
    dp[i + 1][1] = min(dp[i + 1][1], dp[i][1] + b[i]);
    if (i == 0) {
    }
  }
  for (long long int i = 0; i <= n - 1; i++) {
    cout << min(dp[i][0], dp[i][1]) << " ";
  }
  cout << '\n';
  return 0;
}
