#include <bits/stdc++.h>
using namespace std;
const long long MOD = (long long)1e9 + 7;
const long double PI = acos((long double)-1);
inline int Get_bit(int x, int k) { return (x >> (k - 1)) & 1; }
inline long long Gcd(long long a, long long b) {
  long long r;
  while (b) {
    r = a % b;
    a = b;
    b = r;
  }
  return a;
}
inline long long Lcm(long long a, long long b) { return a / Gcd(a, b) * b; }
inline long long Pow(long long n, long long k) {
  long long r = 1;
  for (; k; k >>= 1, n = n * n % MOD) {
    if (k & 1) r = r * n % MOD;
  }
  return r;
}
const int N = 2e5 + 10;
int n, m, k, q, a[N], b[N], g[N], f[N];
void Solve() {
  int c;
  cin >> n >> c;
  for (int i = 1; i < n; i++) {
    cin >> a[i];
  }
  for (int i = 1; i < n; i++) {
    cin >> b[i];
  }
  cout << 0 << " " << min(a[1], c + b[1]) << " ";
  f[2] = c + b[1];
  g[2] = a[1];
  for (int i = 3; i <= n; i++) {
    f[i] = min(g[i - 1] + c + b[i - 1], f[i - 1] + b[i - 1]);
    g[i] = min(f[i - 1] + a[i - 1], g[i - 1] + a[i - 1]);
    cout << min(f[i], g[i]) << " ";
  }
}
int main() {
  ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0),
      cout << fixed << setprecision(10);
  Solve();
}
