#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
int N, F;
constexpr int NN = 15000;
int A[NN], B[NN], C[NN];
constexpr int M = 60 * 15000 + 1;
int main() {
	std::ios_base::sync_with_stdio(false);
	std::cin.tie(nullptr);
	cin >> N >> F;

	for(int i = 0; i < N; i++) cin >> A[i];
	for(int i = 0; i < N; i++) cin >> B[i];
	for(int i = 0; i < N; i++) cin >> C[i];

	bitset<M> dp;
	dp.set(0);
	for(int i = 0; i < N; i++) {
		bitset<M> ndp;
		ndp |= dp << A[i];
		ndp |= dp << B[i];
		ndp |= dp << C[i];
		dp = ndp;
		cout << dp.count() << "\n";
	}
}