#include <bits/stdc++.h>
using namespace std;
long long n;
long long a[200005], b[200005];
long long c;
long long dp[200005][2];
long long run(long long idx, long long on) {
  if (dp[idx][on] != -1) return dp[idx][on];
  if (idx == 0) return 0;
  long long w1, w2;
  if (!on) {
    w1 = a[idx - 1] + run(idx - 1, 0);
    w2 = c + b[idx - 1] + run(idx - 1, 1);
  } else {
    w1 = a[idx - 1] + run(idx - 1, 0);
    w2 = b[idx - 1] + run(idx - 1, 1);
  }
  return dp[idx][on] = min(w1, w2);
}
int main() {
  memset(dp, -1, sizeof dp);
  cin >> n >> c;
  for (long long i = 0; i < n - 1; i++) cin >> a[i];
  for (long long i = 0; i < n - 1; i++) {
    cin >> b[i];
  }
  for (long long i = 0; i < n; i++) {
    cout << run(i, 0) << ' ';
  }
}
