//yukicoder contest 458 G
#include <bits/stdc++.h>
using namespace std;
using ll = long long;

int main() {
    ll N, F;
    cin >> N >> F;
    vector<ll> A(N), B(N), C(N);
    for(ll i = 0; i < N; i ++) cin >> A[i];
    for(ll i = 0; i < N; i ++) cin >> B[i];
    for(ll i = 0; i < N; i ++) cin >> C[i];

    vector<map<ll, bool>> fk(N);
    for(ll k = 0; k < N; k ++) {
        if(k == 0) {
            fk[k][A[k]] = true,
            fk[k][B[k]] = true,
            fk[k][C[k]] = true;
        }
        else {
            for(auto i: fk[k - 1]) {
                fk[k][i.first + A[k]] = true,
                fk[k][i.first + B[k]] = true,
                fk[k][i.first + C[k]] = true;
            }
        }

        cout << fk[k].size() << endl;
    }
    return 0;
}