#include <bits/stdc++.h>
using namespace std;
const long long mod = 1e5 + 3;
const double eps = 1e-6;
const double pi = acos(-1.0);
const int inf = 0x3f3f3f3f;
const int N = 200010;
int n, k;
int a[N];
int b[N];
long long dp[N][2];
int main() {
  std::ios::sync_with_stdio(false);
  cin >> n >> k;
  for (int i = 1; i < n; i++) cin >> a[i];
  for (int i = 1; i < n; i++) cin >> b[i];
  cout << 0 << " ";
  dp[0][1] = inf;
  for (int i = 1; i < n; i++) {
    dp[i][0] = min(dp[i - 1][0] + a[i], dp[i - 1][1] + a[i]);
    dp[i][1] = min(dp[i - 1][0] + b[i] + k, dp[i - 1][1] + b[i]);
    cout << min(dp[i][0], dp[i][1]) << " ";
  }
  return 0;
}
