#include <bits/stdc++.h>
using namespace std;
const int N = 5e5 + 10;
const int inf = 0x3f3f3f3f;
int f[N][2];
int a[N];
int b[N];
int main() {
  int i;
  int n;
  int c;
  cin >> n >> c;
  for (i = 1; i <= n - 1; i++) {
    scanf("%d", &a[i]);
  }
  for (i = 1; i <= n - 1; i++) {
    scanf("%d", &b[i]);
  }
  memset(f, 0, sizeof f);
  f[1][0] = 0;
  f[1][1] = c;
  cout << 0 << " ";
  for (i = 2; i <= n; i++) {
    f[i][0] = min(f[i - 1][0] + a[i - 1], f[i - 1][1] + a[i - 1]);
    f[i][1] = min(f[i - 1][0] + b[i - 1] + c, f[i - 1][1] + b[i - 1]);
    cout << min(f[i][0], f[i][1]) << " ";
  }
  cout << endl;
  return 0;
}
