#include <bits/stdc++.h>
using namespace std;
#if __has_include(<atcoder/all>)
#include <atcoder/all>
#endif
using ll=long long;
using ull=unsigned long long;
using P=pair<ll,ll>;
template<typename T>using minque=priority_queue<T,vector<T>,greater<T>>;
template<typename T>bool chmax(T &a,const T &b){return (a<b?(a=b,true):false);}
template<typename T>bool chmin(T &a,const T &b){return (a>b?(a=b,true):false);}
template<typename T1,typename T2>istream &operator>>(istream &is,pair<T1,T2>&p){is>>p.first>>p.second;return is;}
template<typename T1,typename T2,typename T3>istream &operator>>(istream &is,tuple<T1,T2,T3>&a){is>>std::get<0>(a)>>std::get<1>(a)>>std::get<2>(a);return is;}
template<typename T>istream &operator>>(istream &is,vector<T> &a){for(auto &i:a)is>>i;return is;}
template<typename T1,typename T2>void operator++(pair<T1,T2>&a,int n){a.first++,a.second++;}
template<typename T1,typename T2>void operator--(pair<T1,T2>&a,int n){a.first--,a.second--;}
template<typename T>void operator++(vector<T>&a,int n){for(auto &i:a)i++;}
template<typename T>void operator--(vector<T>&a,int n){for(auto &i:a)i--;}
#define overload3(_1,_2,_3,name,...) name
#define rep1(i,n) for(int i=0;i<(int)(n);i++)
#define rep2(i,l,r) for(int i=(int)(l);i<(int)(r);i++)
#define rep(...) overload3(__VA_ARGS__,rep2,rep1)(__VA_ARGS__)
#define reps(i,l,r) rep2(i,l,r)
#define all(x) x.begin(),x.end()
#define pcnt(x) __builtin_popcountll(x)
#define fin(x) return cout<<(x)<<'\n',static_cast<void>(0)
#define yn(x) cout<<((x)?"Yes\n":"No\n")
#define uniq(x) sort(all(x)),x.erase(unique(all(x)),x.end())
ll myceil(ll a,ll b){return (a+b-1)/b;}
template<typename T,size_t n,size_t id=0>
auto vec(const int (&d)[n],const T &init=T()){
  if constexpr (id<n)return vector(d[id],vec<T,n,id+1>(d,init));
  else return init;
}
#ifdef LOCAL
#include<debug.h>
#else
#define debug(...) static_cast<void>(0)
#define debugg(...) static_cast<void>(0)
template<typename T1,typename T2>ostream &operator<<(ostream &os,const pair<T1,T2>&p){os<<p.first<<' '<<p.second;return os;}
#endif
struct Timer{
  clock_t start;
  Timer(){
    start=clock();
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    cout<<fixed<<setprecision(16);
  }
  inline double now(){return (double)(clock()-start)/1000;}
  #ifdef LOCAL
  ~Timer(){
    cerr<<"time:";
    cerr<<now();
    cerr<<"ms\n";
  }
  #endif
}timer;
void SOLVE();
int main(){
  int testcase=1;
  //cin>>testcase;
  for(int i=0;i<testcase;i++){
    SOLVE();
  }
}
using namespace std;
struct BitSet{
private:
  using u64=uint64_t;
  vector<u64>dat;
  int N;
public:
  BitSet():N(0){}
  explicit BitSet(int n):N(n),dat((n+63)/64){}
  explicit BitSet(const string&s):N(s.size()),dat((s.size()+63)/64){
    for(int i=0;i<N;i++)if(s[i]=='1')dat[i>>6]|=u64(1)<<(i&63);
  }
  void set(int i){dat[i>>6]|=u64(1)<<(i&63);}
  void reset(int i){dat[i>>6]&=~(u64(1)<<(i&63));}
  void flip(int i){dat[i>>6]^=u64(1)<<(i&63);}
  int size()const{return N;}
  int popcount()const{
    int res=0;
    for(int i=0;i<dat.size();i++)res+=__builtin_popcountll(dat[i]);
    return res;
  }
  bool operator[](int i)const{return dat[i>>6]>>(i&63)&1;}
  BitSet operator>>(int i)const{
    BitSet res(N);
    if(i>=N)return res;
    int s=i>>6,t=i&63;
    if(t==0){
      for(int j=s;j<dat.size();j++)res.dat[j-s]=dat[j];
    }
    else{
      for(int j=s;j<dat.size()-1;j++){
        res.dat[j-s]=(dat[j]>>t)|(dat[j+1]<<(64-t));
      }
      res.dat[dat.size()-1-s]=dat[dat.size()-1]>>t;
    }
    return res;
  }
  BitSet operator<<(int i)const{
    BitSet res(N);
    if(i>=N)return res;
    int s=i>>6,t=i&63;
    if(t==0){
      for(int j=s;j<dat.size();j++)res.dat[j]=dat[j-s];
    }
    else{
      res.dat[s]=dat[0]<<t;
      for(int j=s+1;j<dat.size();j++){
        res.dat[j]=(dat[j-s]<<t)|(dat[j-s-1]>>(64-t));
      }
      if(N&63)res.dat.back()&=(u64(1)<<(N&63))-1;
    }
    return res;
  }
  BitSet &operator<<=(int i){
    (*this)=(*this)<<i;
    return *this;
  }
  BitSet &operator>>=(int i){
    (*this)=(*this)>>i;
    return *this;
  }
  BitSet &operator^=(const BitSet&rhs){
    assert(N==rhs.N);
    for(int i=0;i<dat.size();i++)dat[i]^=rhs.dat[i];
    return *this;
  }
  BitSet &operator&=(const BitSet&rhs){
    assert(N==rhs.N);
    for(int i=0;i<dat.size();i++)dat[i]&=rhs.dat[i];
    return *this;
  }
  BitSet &operator|=(const BitSet&rhs){
    assert(N==rhs.N);
    for(int i=0;i<dat.size();i++)dat[i]|=rhs.dat[i];
    return *this;
  }
  BitSet operator^(const BitSet&rhs){return BitSet(*this)^=rhs;}
  BitSet operator&(const BitSet&rhs){return BitSet(*this)&=rhs;}
  BitSet operator|(const BitSet&rhs){return BitSet(*this)|=rhs;}
  friend istream &operator>>(istream &is,BitSet&bs){
    char c=is.get();
    while(isspace(c))c=is.get();
    is.unget();
    for(int i=0;i<bs.N;i++){
      char c=is.get();
      if(c=='1')bs.dat[i>>6]|=u64(1)<<(i&63);
    }
    return is;
  }
  friend ostream &operator<<(ostream&os,const BitSet&bs){
    for(int i=0;i<bs.N;i++){
      if(bs.dat[i>>6]>>(i&63)&1)os<<'1';
      else os<<'0';
    }
    return os;
  }
};
void SOLVE(){
  int n,f;
  cin>>n>>f;
  BitSet bs(n*f+1);
  bs.set(0);
  vector<int>a(n),b(n),c(n);
  cin>>a>>b>>c;
  rep(i,n){
    bs=(bs<<a[i])|(bs<<b[i])|(bs<<c[i]);
    cout<<bs.popcount()<<'\n';
  }
}