#include <bits/stdc++.h>
using namespace std;
const int maxn = 2e5 + 7;
const int INF = 0x3f3f3f3f;
const int mod = 2e5 + 7;
int a[maxn];
int b[maxn];
int s[maxn][2];
int main() {
  int n, c;
  cin >> n >> c;
  for (int i = 1; i <= n - 1; ++i) cin >> a[i];
  for (int i = 1; i <= n - 1; ++i) cin >> b[i];
  printf("0 ");
  s[1][1] = b[1] + c;
  s[1][0] = a[1];
  printf("%d ", min(s[1][1], s[1][0]));
  for (int i = 2; i < n; ++i) {
    s[i][1] = min(s[i - 1][0] + b[i] + c, s[i - 1][1] + b[i]);
    s[i][0] = min(s[i - 1][0] + a[i], s[i - 1][1] + a[i]);
    printf("%d ", min(s[i][1], s[i][0]));
  }
}
