#include <bits/stdc++.h>
using namespace std;
long long n, c;
vector<vector<long long> > a;
long long dp[200000 + 5][2][2];
long long fun(long long idx, bool state, bool prev) {
  if (idx == 0) return 0;
  if (dp[idx][state][prev]) return dp[idx][state][prev];
  if (prev || !state)
    return dp[idx][state][prev] = a[idx][state] + min(fun(idx - 1, 0, state),
                                                      fun(idx - 1, 1, state));
  return dp[idx][state][prev] =
             c + a[idx][state] +
             min(fun(idx - 1, 0, state), fun(idx - 1, 1, state));
}
void solve() {
  cin >> n >> c;
  a.resize(n + 1, vector<long long>(2));
  for (long long i = 1; i <= n - 1; i++) cin >> a[i][0];
  for (long long i = 1; i <= n - 1; i++) cin >> a[i][1];
  dp[n][0][0] = dp[n][1][0] = min(fun(n - 1, 0, 0), fun(n - 1, 1, 0));
  for (long long i = 0; i <= n - 1; i++)
    cout << min(dp[i][0][0], dp[i][1][0]) << ' ';
  cout << '\n';
}
int main() {
  ios::sync_with_stdio(false);
  solve();
}
