#include <vector>
#include <iostream>
using namespace std;

class node {
public:
	int p, l, r;
	node() : p(-1), l(-1), r(-1) {}
	node(int p_, int l_, int r_) : p(p_), l(l_), r(r_) {}
};

class binary_tree {
public:
	int root;
	vector<node> v;
	binary_tree() : root(-1), v(vector<node>()) {}
	binary_tree(int n) : root(-1), v(vector<node>(n)) {}
};

binary_tree cartesian_tree(int N, const vector<long long>& A) {
	binary_tree T(N);
	vector<int> st;
	int pos = 0;
	for (int i = 0; i < N; i++) {
		int u = -1;
		while (!st.empty() && A[st.back()] < A[i]) {
			u = st.back();
			st.pop_back();
		}
		if (u != -1) {
			T.v[i].l = u;
			T.v[u].p = i;
		}
		if (!st.empty()) {
			T.v[i].p = st.back();
			T.v[st.back()].r = i;
		}
		st.push_back(i);
	}
	T.root = st[0];
	return T;
}

vector<long long> solve(int N, long long L, const vector<long long>& A, const vector<long long>& X) {
	binary_tree T = cartesian_tree(N, A);
	vector<long long> s = X;
	auto build_tree = [&](auto& self, int x) -> void {
		if (T.v[x].l != -1) {
			self(self, T.v[x].l);
			s[x] += s[T.v[x].l];
		}
		if (T.v[x].r != -1) {
			self(self, T.v[x].r);
			s[x] += s[T.v[x].r];
		}
	};
	build_tree(build_tree, T.root);
	vector<long long> ans(N - 1);
	for (int i = 0; i < N - 1; i++) {
		int base = (A[i] < A[i + 1] ? i : i + 1);
		if (A[base] < L) {
			int pos = base;
			while (pos != T.root) {
				if (A[T.v[pos].p] >= s[pos] + L) {
					break;
				}
				pos = T.v[pos].p;
			}
			ans[i] = s[pos] + L;
		} else {
			ans[i] = L;
		}
	}
	return ans;
}

int main() {
	cin.tie(nullptr);
	ios::sync_with_stdio(false);
	int N; long long L;
	cin >> N >> L;
	vector<long long> A(N), X(N);
	for (int i = 0; i < N; i++) {
		cin >> A[i];
	}
	for (int i = 0; i < N; i++) {
		cin >> X[i];
	}
	vector<long long> ans = solve(N, L, A, X);
	for (int i = 0; i < N - 1; i++) {
		cout << ans[i] << (i != N - 2 ? ' ' : '\n');
	}
	return 0;
}