#pragma GCC optimize("unroll-loops")
#pragma GCC optimize("Ofast")
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for(int i = 0; i < n; ++i)
#define all(x) (x).begin(),(x).end()
int main(){
    cin.tie(nullptr);
    ios::sync_with_stdio(false);
    int n,f;
    cin >> n >> f;
    bitset<900001> bit(1);
    vector<vector<uint8_t>> a(n,vector<uint8_t>(3));
    rep(i,3)rep(j,n) cin >> a[j][i];
    rep(i,n){
        sort(all(a[i]));
        bit |= ((bit<<(a[i][1]-a[i][0])) | (bit<<(a[i][2]-a[i][0])));
        cout << bit.count() << '\n';
    }
    return 0;
}