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