#include <bits/stdc++.h>
#define ALL(x) (x).begin(), (x).end()
#define LB(v, x) (int)(lower_bound(ALL(v), x) - v.begin())
#define UQ(v) sort(ALL(v)), (v).erase(unique(ALL(v)), (v).end())
#define IO ios::sync_with_stdio(false), cin.tie(nullptr);
#define chmax(a, b) (a) = (a) < (b) ? (b) : (a)
#define chmin(a, b) (a) = (a) < (b) ? (a) : (b)
using namespace std;
using ll = long long;
const int INF = 1e9 + 10;
const ll INFL = 4e18;

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

    const int M = N * F;
    vector<bool> dp(M + 1);
    for (int i = 0; i < 3; i++) dp[A[0][i]] = true;
    int ans = count(ALL(dp), true);
    cout << ans << '\n';
    for (int i = 1; i < N; i++) {
        for (int j = M; j >= 0; j--) {
            if (dp[j]) {
                for (int a : A[i]) {
                    if (j + a <= M && !dp[j + a]) {
                        ans++;
                        dp[j + a] = true;
                    }
                }
            }
        }
        cout << ans << '\n';
    }
}