#include<bits/stdc++.h>
using namespace std;
#pragma GCC target("avx2")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
#define rep(i,a,b) for(int i=a;i<b;i++)
#define rrep(i,a,b) for(int i=a;i>=b;i--)
#define fore(i,a) for(auto &i:a)
#define pb push_back
#define all(a) begin(a),end(a)
#define allr(a) rbegin(a),rend(a)
#define ff first
#define ss second
template<class T> bool chmax(T& a,T b){return a<b?a=b,1:0;}
template<class T> bool chmin(T& a,T b){return a>b?a=b,1:0;}
using ll =long long;
using pii =pair<int,int>;
using pll=pair<long long,long long>;
using vi=vector<int>;
using vll=vector<ll>;
inline bool ingrid(int a,int b,int h,int w){
    return 0<=a&&a<h&&0<=b&&b<w;
}

const int INFI = numeric_limits<int>::max() / 2; const long long INFL = numeric_limits<long long>::max() / 2;
constexpr pii dx4[4] = {pii{-1, 0}, pii{0, -1},pii{1, 0}, pii{0, 1} };
#define endl '\n'

int n,f;
vector<vector<int>> a;
void solve(){
    bitset<250> dp(1);
    rep(i,0,n){
        bitset<250> nxt(0);
        rep(j,0,3){
            nxt|=(dp<<a[j][i]);
        }
        swap(dp,nxt);
        cout<<dp.count()<<endl;
    }

}

int main(){
    cin>>n>>f;
    a.resize(3,vector<int>(n));
    rep(i,0,3){
        rep(j,0,n){
            cin>>a[i][j];
        }
    }
    solve();
    return 0;
}
/*
つらい
*/