#include <bits/stdc++.h>
using namespace std;
const int MAXN = 1000 * 100 * 2 + 10;
long long int a[MAXN];
long long int b[MAXN];
long long int p[MAXN];
long long int d[MAXN];
long long int mod = 1000 * 1000 * 1000 + 7;
int main() {
  ios_base::sync_with_stdio(false), cin.tie(0), cout.tie(0);
  int n, c;
  cin >> n >> c;
  for (int i = 0; i < n - 1; i++) {
    cin >> a[i];
  }
  for (int i = 0; i < n - 1; i++) {
    cin >> b[i];
  }
  cout << 0 << ' ';
  for (int i = 0; i < n - 1; i++) {
    if (i == 0) {
      d[i] = c + b[i];
      p[i] = a[i];
    } else {
      d[i] = min(d[i - 1] + b[i], p[i - 1] + b[i] + c);
      p[i] = min(p[i - 1] + a[i], d[i - 1] + a[i]);
    }
    cout << min(d[i], p[i]) << ' ';
  }
  cout << endl;
  return 0;
}
