#include<bits/stdc++.h>
using namespace std;
using ll=long long;
#define all(v) v.begin(),v.end()
#define rall(v) v.rbegin(),v.rend()
template<class T> bool chmax(T &a, T b){if (a < b){a = b;return true;} else return false;}
template<class T> bool chmin(T &a, T b){if (a > b){a = b;return true;} else return false;}

void Solve(){
    int N,F;
    cin>>N>>F;
    vector<int>A(N),B(N),C(N);
    for(int i=0;i<N;i++)cin>>A[i];
    for(int i=0;i<N;i++)cin>>B[i];
    for(int i=0;i<N;i++)cin>>C[i];
    bitset<900001>BS;
    BS[0]=1;
    for(int i=0;i<N;i++){
        int m=min(A[i],min(B[i],C[i]));
        A[i]-=m,B[i]-=m,C[i]-=m;
        if(A[i]>0&&B[i]>0&&C[i]==0)BS|=BS<<A[i]|BS<<B[i];
        else if(A[i]>0&&B[i]==0&&C[i]>0)BS|=BS<<A[i]|BS<<C[i];
        else if(A[i]==0&&B[i]>0&&C[i]>0)BS|=BS<<B[i]|BS<<C[i];
        else if(A[i]==0&&B[i]==0&&C[i]>0)BS|=BS<<C[i];
        else if(A[i]==0&&B[i]>0&&C[i]==0)BS|=BS<<B[i];
        else if(A[i]>0&&B[i]==0&&C[i]==0)BS|=BS<<A[i];
        cout<<BS.count()<<"\n";
    }
}

int main(){
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    Solve();
}