#include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
	std::ios_base::sync_with_stdio(false);
	std::cin.tie(nullptr);
	int N, F;
	cin >> N >> F;
	vector<int> A(N), B(N), C(N);
	for(auto&x: A) cin >> x;
	for(auto&x: B) cin >> x;
	for(auto&x: C) cin >> x;
	
	vector<bool> dp(N * F + 1);
	int M = F;
	int ans = 0;
	auto Push = [&](vector<bool>& DP, int k, int SZ) {
		if(!DP[k]) {
			DP[k] = 1;
			ans++;
		}
	};
	Push(dp, A[0], F);
	Push(dp, B[0], F);
	Push(dp, C[0], F);
	cout << ans << "\n";
	for(int i = 1; i < N; i++) {
		for(int j = M; j >= 0; j--) if(dp[j]){
			Push(dp, j + A[i], M + F);
			Push(dp, j + B[i], M + F);
			Push(dp, j + C[i], M + F);
		}
		M += F;
		cout << ans << "\n";
	}
	/*
	int M = 60;
	vector<bool> dp(F * N + 1);
	int ans = 0;
	auto Push = [&](vector<bool>& DP, int k) {
		if() return;
		if(!DP[k]) {
			DP[k] = 1;
			ans++;
		}
	};
	Push(dp, A[0]), Push(dp, B[0]), Push(dp, C[0]);

	cout << ans << "\n";
	for(int i = 1; i < N; i++) {
		M += 61;
		vector<bool> ndp = dp;
		ndp.resize(M);
		for(int j = 0; j < ndp.size(); j++) cout << ndp[j] << " ";
		cout << endl;
		for(int j = 0, sz = dp.size(); j < sz; j++) if(dp[j]) {
			Push(ndp, A[i] + j), Push(ndp, B[i] + j), Push(ndp, C[i] + j);
		}
		cout << ans << "\n";
		dp = ndp;
	}
	*/
}