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