#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<300001>BS1;
    bitset<600001>BS2;
    bitset<900001>BS3;
    BS1[0]=1;
    int now=0;
    for(int i=0;i<N;i++){
        if(F*(i+1)<=300000-F){
            BS1=(BS1<<A[i])|(BS1<<B[i])|(BS1<<C[i]);
            cout<<BS1.count()<<"\n";
        }else if(F*i<=300000-F&&F*(i+1)>300000-F){
            BS1=(BS1<<A[i])|(BS1<<B[i])|(BS1<<C[i]);
            for(int j=0;j<=300000;j++)BS2[j]=BS1[j];
            cout<<BS2.count()<<"\n";
        }else if(F*(i+1)<=600000-F){
            BS2=(BS2<<A[i])|(BS2<<B[i])|(BS2<<C[i]);
            cout<<BS2.count()<<"\n";
        }else if(F*i<=600000-F&&F*(i+1)>600000-F){
            BS2=(BS2<<A[i])|(BS2<<B[i])|(BS2<<C[i]);
            for(int j=0;j<=600000;j++)BS3[j]=BS2[j];
            cout<<BS3.count()<<"\n";
        }else{
            BS3=(BS3<<A[i])|(BS3<<B[i])|(BS3<<C[i]);
            cout<<BS3.count()<<"\n";
        }
    }
}

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