#include <iostream>
#include <vector>
#include <algorithm>
#include <cmath>
#include <bitset>
#include <bits/stdc++.h>
#include <atcoder/all>
using namespace std;
using namespace atcoder;
using ll = long long;
using mint = modint998244353;
using vi = vector<int>;
using vvi = vector<vi>;
using vvvi = vector<vvi>;
using vll = vector<ll>;
using vvll = vector<vll>;
using vvvll = vector<vvll>;
using vmi = vector<mint>;
using vvmi = vector<vmi>;
using vvvmi = vector<vvmi>;
#define all(a) (a).begin(), (a).end()
#define rep2(i, m, n) for (int i = (m); i < (n); ++i)
#define rep(i, n) rep2(i, 0, n)
#define drep2(i, m, n) for (int i = (m)-1; i >= (n); --i)
#define drep(i, n) drep2(i, n, 0)

void solve(){
    
}

int main(){

    int n, f; cin >> n >> f;
    vvi v(3, vi(n)); rep(i, 3)rep(j, n)cin >> v[i][j];
    bitset<900010> bs(0);
    rep(i, n){
        if(i == 0){
            rep(j, 3)bs.set(v[j][i]);
        }else{
            bitset<900010> tmp = bs;
            rep(j, 3){
                
                if(j == 0){
                    bs = bs << v[j][i];
                }else{
                    tmp = tmp << v[j][i];
                    bs = bs | tmp;
                    tmp = tmp >> v[j][i];
                }
            }
        }
        cout << bs.count() << endl;
    }
    return 0;
}