#include <bits/stdc++.h>
using namespace std;
template <typename A>
ostream &operator<<(ostream &cout, vector<A> const &v);
template <typename A, typename B>
ostream &operator<<(ostream &cout, pair<A, B> const &p) {
  return cout << "(" << p.first << ", " << p.second << ")";
}
template <typename A>
ostream &operator<<(ostream &cout, vector<A> const &v) {
  cout << "[ ";
  for (int i = 0; i < v.size(); i++) {
    if (i) cout << ", ";
    cout << v[i];
  }
  return cout << " ]";
}
template <typename A>
ostream &operator<<(ostream &cout, vector<vector<A>> const &v) {
  cout << "[";
  for (int i = 0; i < v.size(); i++) {
    if (i) {
      cout << " ";
    }
    cout << v[i];
    if (i < v.size() - 1) {
      cout << endl;
    }
  }
  return cout << "]";
}
template <typename A, typename B>
istream &operator>>(istream &cin, pair<A, B> &p) {
  cin >> p.first;
  return cin >> p.second;
}
void solve() {
  int n, c;
  cin >> n >> c;
  vector<long long> a(n), b(n);
  for (int i = 1; i < n; i++) {
    cin >> a[i];
  }
  for (int i = 1; i < n; i++) {
    cin >> b[i];
  }
  vector<vector<long long>> dp(n + 1, vector<long long>(2, INT_MAX));
  dp[1][0] = 0;
  dp[1][1] = c;
  for (int i = 0; i < n; 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] + c);
    dp[i + 1][1] = min(dp[i + 1][1], dp[i][1] + b[i]);
  }
  for (int i = 1; i <= n; i++) {
    cout << min(dp[i][0], dp[i][1]) << " ";
  }
  cout << endl;
}
int main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  int t = 1;
  while (t--) {
    solve();
  }
}
