#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using vl = vector<ll>;
using vll = vector<vector<ll>>;
using vi = vector<int>;
using vii = vector<vector<int>>;
using vpii = vector<pair<int, int>>;
int up_bound_int = (1 << 31) - 1;
ll inf = 1e18, inf_prec = (1ll << 63) - 1;
ll binpow(ll a, ll n) {
  ll res = 1;
  while (n) {
    if (n & 1) res = (res * a) % 1000000007;
    a = (a * a) % 1000000007;
    n >>= 1;
  }
  return res;
}
const double PI = acos(-1);
int arr[2][200000 + 10];
int arr2[2][200000 + 10];
int main() {
  int n, c;
  cin >> n >> c;
  for (int i = 0; i < int(n - 1); i++) cin >> arr[0][i];
  for (int i = 0; i < int(n - 1); i++) cin >> arr[1][i];
  arr2[0][0] = 0;
  arr2[1][0] = c;
  cout << 0 << " ";
  for (int i = int(1); i < int(n); i++) {
    arr2[0][i] = arr[0][i - 1] + min(arr2[0][i - 1], arr2[1][i - 1]);
    arr2[1][i] = arr[1][i - 1] + min(arr2[0][i - 1] + c, arr2[1][i - 1]);
    cout << min(arr2[0][i], arr2[1][i]) << " ";
  }
  return 0;
}
