#include <bits/stdc++.h>
using namespace std;
long long input1[200005];
long long input2[200005];
long long dp[200005][2];
int main() {
  int n, c;
  scanf("%d%d", &n, &c);
  for (int i = 1; i <= n - 1; i++) {
    scanf("%lld", &input1[i]);
  }
  for (int i = 1; i <= n - 1; i++) {
    scanf("%lld", &input2[i]);
  }
  for (int i = 2; i <= n; i++) {
    dp[i][0] = min(dp[i - 1][0], dp[i - 1][1]) + input1[i - 1];
    if (i == 2)
      dp[i][1] = min(dp[i - 1][0], dp[i - 1][1]) + input2[i - 1] + c;
    else {
      dp[i][1] =
          min(dp[i - 1][0] + c + input2[i - 1], dp[i - 1][1] + input2[i - 1]);
    }
  }
  for (int i = 1; i <= n; i++) {
    printf("%lld ", min(dp[i][0], dp[i][1]));
  }
}
