#include<iostream>

#include<cstdio>

#include<cstring>

#include<string>

#include<algorithm>

#include<cctype>

#include<cmath>

#include<cstdlib>

#include<queue>

#include<ctime>

#include<vector>

#include<set>

#include<map>

#include<stack>

using namespace std;

priority_queue<pair<int,int> >q;

bool vis[][][];

int d[],v[],a[],b[],n,m,K,res;

inline void go(int x,int y,int z){

    if(vis[x][y][z])return;

    vis[x][y][z]=;

    if(x==m){

      if(y==K&&z<n&&res+b[z]<d[z]){

          d[z]=res+b[z];

          q.push(make_pair(-d[z],z));

      }

    }else {

      go(x+,y,z);

      if(y<K)go(x+,y+,z^(<<x));

    }

}

int main(){

    int i,j,k;

    scanf("%d%d",&n,&K);

    while((<<m)<n)m++;

    memset(d,0x3,sizeof(d));

    for(i=;i<n;i++){

      scanf("%d",&v[i]);

      if(v[i]>=)d[i]=v[i],q.push(make_pair(-d[i],i));

    }

    for(i=;i<n;i++)scanf("%d",&a[i]);

    for(i=;i<n;i++)scanf("%d",&b[i]);

    while(!q.empty()){

      int x=q.top().second,y=-q.top().first;

      cout<<y<<endl;

      q.pop();

      if(x<n){

          if(y>d[x])continue;

          q.push(make_pair(-y-a[x],x+n));

      }else {

          res=y;

          go(,,x-n);

      }

    }

    int Ans=;

    for(i=;i<n;i++)Ans^=d[i];

    cout<<Ans;

    return ;

}