#include <bits/stdc++.h>
using namespace std;
const long long M = 2e5 + 10;
const long long INF = 0x3f3f3f3f;
const long long mod = 998244353;
int mans = INF;
int n, c, dp[M][2], f[M], l[M];
int main() {
  scanf("%d%d", &n, &c);
  memset(dp, INF, sizeof(dp));
  for (int i = 1; i < n; i++) scanf("%d", &f[i]);
  for (int i = 1; i < n; i++) scanf("%d", &l[i]);
  dp[0][0] = c;
  dp[0][1] = 0;
  for (int i = 1; i < n; i++) {
    dp[i][0] = min(dp[i - 1][0], dp[i - 1][1] + c) + l[i];
    dp[i][1] = min(dp[i - 1][0], dp[i - 1][1]) + f[i];
  }
  for (int i = 0; i < n; i++) printf("%d ", min(dp[i][0], dp[i][1]));
  puts("");
  return 0;
}
