#include <bits/stdc++.h>
using namespace std;
const int inf = 2e9;
long long gcd(long long a, long long b) {
  if (a == 0) return b;
  return gcd(b % a, a);
}
int main() {
  ios::sync_with_stdio(0);
  cin.tie(0);
  int n, c;
  cin >> n >> c;
  int a[n], b[n];
  for (int i = 1; i < n; i++) cin >> a[i];
  for (int i = 1; i < n; i++) cin >> b[i];
  int d[2][n];
  fill(d[0], d[0] + n, inf);
  fill(d[1], d[1] + n, inf);
  d[0][0] = 0;
  d[1][0] = c;
  for (int i = 1; i < n; i++) {
    d[0][i] = min(d[0][i - 1] + a[i], d[1][i - 1] + a[i]);
    d[1][i] = min(d[0][i - 1] + c + b[i], d[1][i - 1] + b[i]);
  }
  for (int i = 0; i < n; i++) cout << min(d[0][i], d[1][i]) << ' ';
  return 0;
}
