#include <bits/stdc++.h>
using namespace std;
const long long mod = 1e9 + 7;
template <class T>
void _print(T t) {
  cerr << t;
}
template <class T, class V>
void _print(pair<T, V> p) {
  cerr << "{";
  _print(p.first);
  cerr << ",";
  _print(p.second);
  cerr << "}";
}
template <class T>
void _print(vector<T> v) {
  cerr << "[ ";
  for (T i : v) {
    _print(i);
    cerr << " ";
  }
  cerr << "]";
}
template <class T>
void _print(set<T> v) {
  cerr << "[ ";
  for (T i : v) {
    _print(i);
    cerr << " ";
  }
  cerr << "]";
}
template <class T>
void _print(multiset<T> v) {
  cerr << "[ ";
  for (T i : v) {
    _print(i);
    cerr << " ";
  }
  cerr << "]";
}
template <class T, class V>
void _print(map<T, V> v) {
  cerr << "[ ";
  for (auto i : v) {
    _print(i);
    cerr << " ";
  }
  cerr << "]";
}
template <class T, class V>
void _print(unordered_map<T, V> v) {
  cerr << "[ ";
  for (auto i : v) {
    _print(i);
    cerr << " ";
  }
  cerr << "]";
}
vector<long long> sieve(long long n) {
  long long *arr = new long long[n + 1]();
  vector<long long> vect;
  for (long long i = 2; i <= n; i++)
    if (arr[i] == 0) {
      vect.push_back(i);
      for (long long j = 2 * i; j <= n; j += i) arr[j] = 1;
    }
  return vect;
}
void cp() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  cout.tie(NULL);
}
void solve() {
  long long n, c;
  cin >> n >> c;
  vector<long long> a(n), b(n);
  for (long long i = 0; i < n - 1; i++) cin >> a[i];
  for (long long i = 0; i < n - 1; i++) cin >> b[i];
  vector<vector<long long> > dp(n, vector<long long>(2, 0));
  cout << 0 << " ";
  dp[0][1] = c;
  for (long long i = 1; i < n; i++) {
    dp[i][0] = min(a[i - 1] + dp[i - 1][0], a[i - 1] + dp[i - 1][1]);
    dp[i][1] = min(b[i - 1] + dp[i - 1][0] + c, b[i - 1] + dp[i - 1][1]);
    cout << min(dp[i][0], dp[i][1]) << " ";
  }
}
int32_t main() {
  cp();
  long long t = 1;
  while (t--) solve();
  return 0;
}
