#include <cstdio>
#include <cstring>
#include <algorithm>
using namespace std;
int a[65537],b[65537],g[65537],h[65537],ans[65537],fk[65537];
int f[21][21];
int i,j,k,m,n,o,p,l,s,t,x,y;
void FWT(int *P,int opt)
{
for (int i=2;i<=n;i<<=1)
for (int p=i>>1,j=0;j<n;j+=i)
for (int k=j;k<j+p;++k)
P[k+p]+=P[k]*opt;
}
int main()
{
freopen("convolution.in","r",stdin);
freopen("convolution.out","w",stdout);
scanf("%d%d",&n,&m);n=1<<n;
for (i=0;i<=n-1;i++) scanf("%d",&a[i]);
for (i=0;i<=n-1;i++) scanf("%d",&b[i]);
for (i=0;i<=m-1;i++)
for (j=0;j<=m-1;j++)
scanf("%d",&f[i][j]);
for (x=0;x<=m-1;x++)
for (y=0;y<=m-1;y++)
{
for (i=0;i<n;i++) g[i]=(a[i]==x),h[i]=(b[i]==y);
FWT(g,1);FWT(h,1);
for (i=0;i<n;i++) fk[i]=g[i]*h[i];
FWT(fk,-1);
for (i=0;i<n;i++)
{
if (fk[i]>0) ans[i]=max(ans[i],f[x][y]);
}
}
for (i=0;i<n;i++) printf("%d ",ans[i]);
return 0;
}