#include <bits/stdc++.h>
using namespace std;
int a[200010], b[200010], q, i, n, sol, j, el, c, D[2][200010], lift;
int main() {
  cin >> n >> c;
  for (i = 1; i < n; i++) cin >> a[i];
  for (i = 1; i < n; i++) cin >> b[i];
  D[0][2] = D[0][1] + a[1];
  D[1][2] = D[0][1] + b[1] + c;
  for (i = 3; i <= n; i++) {
    D[0][i] = min(D[0][i - 1] + a[i - 1], D[1][i - 1] + a[i - 1]);
    D[1][i] = min(D[1][i - 1] + b[i - 1], D[0][i - 1] + b[i - 1] + c);
  }
  for (i = 1; i <= n; i++) cout << min(D[0][i], D[1][i]) << " ";
  return 0;
}
