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