#include <bits/stdc++.h>
using namespace std;
const int SZ = 212345;
int n, a[SZ], b[SZ], c, ans[SZ][2];
int main() {
  scanf("%d%d", &n, &c);
  for (int i = 1; i < n; i++) {
    scanf("%d", a + i);
  }
  for (int i = 1; i < n; i++) {
    scanf("%d", b + i);
  }
  ans[0][1] = c;
  for (int i = 1, j = 1; i < n; i++) {
    ans[i][0] = min(ans[i - 1][0], ans[i - 1][1]) + a[i];
    ans[i][1] = min(ans[i - 1][0] + b[i] + c, ans[i - 1][1] + b[i]);
  }
  for (int i = 0; i < n; i++) {
    printf("%d ", min(ans[i][0], ans[i][1]));
  }
  return 0;
}
