#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 = 12000 * 60 + 1;
    bitset<M> st;
    for (int i = 0; i < 3; i++) st[A[0][i]] = 1;
    cout << st.count() << '\n';
    for (int i = 1; i < N; i++) {
        vector<bitset<M>> st2(3);
        st = (st << A[i][0]) | (st << A[i][1]) | (st << A[i][2]);
        cout << st.count() << '\n';
    }
}