# include <bits/stdc++.h>
using namespace std;
mt19937 rand_Gen(15645865);
const int MOD = 256;
const clock_t begin_time = clock();
const float Final_Time = 4.6;
const float Time_Per_Test = 0.5;
const int clrs = 16;
 int mindist=1000;
const int maxitr = 25000;
int MD[12] = {100000,100,7000,20000,1000,400,3000,50000,40000,50,2000,800000};
//int MI[20] = {}
struct colors
{
    int r,g,b;
};
colors s[505][505];
colors p[16];
int id[505][505];
int ansid[505][505];
colors ansp[16];
long long ANS=1e18;
int n,m;
int num[16];
struct pixels
{
    int x,y;
    colors p;
};
pixels w[250005];
int br = 0;
int calc(colors a, colors b)
{
    int ans = (a.r-b.r)*(a.r-b.r)+(a.g-b.g)*(a.g-b.g)+(a.b-b.b)*(a.b-b.b);
    return ans;
}

void makerandomcolors()
{
    int i,j;
    bool fl ;
    int br; colors x;
    for(i=0;i<clrs;i++)
    {
        fl = false;
        br = 0;
        while(!fl&&br<=maxitr)
        {
            br++;
           x = s[rand_Gen()%n+1][rand_Gen()%m+1];
            fl = true;
            for(j=0;j<i;j++)
            {
                if(calc(p[j],x)<=mindist){fl=false;break;}
            }
        }
        p[i] = x;
        //cout<<p[i].r<<" "<<p[i].g<<endl;
    }
}
void checkforbest()
{
    long long curr = 0;
    int i,j;
    for(i=1;i<=n;i++)
    {
        for(j=1;j<=m;j++)
        {
            curr+=calc(p[id[i][j]],s[i][j]);
        }
    }
    if(curr<ANS)
    {
        for(i=1;i<=n;i++)
            for(j=1;j<=m;j++)
            ansid[i][j]=id[i][j];
        ANS=curr;
        for(i=0;i<clrs;i++)
            ansp[i]=p[i];
    }
    return ;
}
void updatecol(int i,colors a)
{
    p[i].r = (p[i].r*num[i]+a.r)/(num[i]+1);
    p[i].g = (p[i].g*num[i]+a.g)/(num[i]+1);
    p[i].b = (p[i].b*num[i]+a.b)/(num[i]+1);
    num[i]++;
}
int findandupdatecolor(colors a)
{
    int i,j,mins = 1e9,t;
    colors b;
    for(i=0;i<clrs;i++)
    {   b.r = (p[i].r*num[i]+a.r)/(num[i]+1);
    b.g = (p[i].g*num[i]+a.g)/(num[i]+1);
    b.b = (p[i].b*num[i]+a.b)/(num[i]+1);
        if(mins>calc(a,b))
        {

            mins = calc(a,b);
            t = i;
        }
    }
    if(t==3)
      //  cout<<"SPECIAL: "<<a.r<<" "<<a.g<<" "<<a.b<<" "<<p[t].r<<" "<<p[t].g<<" "<<p[t].b<<endl;
    updatecol(t,a);
    return t;
}
bool cmpr(pixels i, pixels j)
{
    if(i.p.r==j.p.r)
    {
        if(i.p.g==j.p.g)
            return i.p.b<j.p.b;
        return i.p.g<j.p.g;
    }
    return i.p.r<j.p.r;
}
bool cmpg(pixels i, pixels j)
{
    if(i.p.g==j.p.g)
    {
        if(i.p.r==j.p.r)
            return i.p.b<j.p.b;
        return i.p.r<j.p.r;
    }
    return i.p.g<j.p.g;
}
bool cmpb(pixels i, pixels j)
{
    if(i.p.b==j.p.b)
    {
        if(i.p.g==j.p.g)
            return i.p.r<j.p.r;
        return i.p.g<j.p.g;
    }
    return i.p.b<j.p.b;
}
void sortw(int from, int to)
{
    int minr=1e9,ming=1e9,minb=1e9,maxg=0,maxb=0,maxr=0;
    int i,j;
    for(i=from;i<=to;i++)
    {
        minr = min(minr,w[i].p.r);
        ming = min(ming,w[i].p.g);
        minb = min(minb,w[i].p.b);
        maxr = max(maxr,w[i].p.r);
        maxg = max(maxg,w[i].p.g);
        maxb = max(maxb,w[i].p.b);
    }
    int dr = maxr-minr;
    int dg = maxg-ming;
    int db = maxb-minb;
    if(dr>=dg&&dr>=db)sort(w+from,w+to+1,cmpr);
    else
    if(dg>=dr&&dg>=db)sort(w+from,w+to+1,cmpg);
    else
    sort(w+from,w+to+1,cmpb);
}
colors calcav(int from, int to, int id1)
{
    sortw(from,to);

    colors t;
    t = w[(from+to)/2].p;
   /* t.r=0;
    t.g=0;
    t.b=0;*/
    int i;
    for(i=from;i<=to;i++)
    {
        id[w[i].x][w[i].y]=id1;
       /* t.r+=w[i].p.r;
        t.g+=w[i].p.g;
        t.b+=w[i].p.b;*/
    }
    int br = to-from+1;
/*
    t.r = t.r/br;
    t.g = t.g/br;
    t.b = t.b/br;
num[id1] = to-from+1;*/
num[id1] = 1;
    return t;
}
void solvefirstcase()
{ //cout<<"OK"<<endl;
    /// read_data
    int w1,h;
    cin>>w1>>h;
    int i,j;
    pixels r;
    for(i=1;i<=h;i++)
    {
        for(j=1;j<=w1;j++)
        {
            br++;
            cin>>s[i][j].r>>s[i][j].g>>s[i][j].b;
            r.p=s[i][j];
            r.x=i;
            r.y=j;
            w[br]=r;
        }
    }
sortw(1,br);
int mid1 = br/2;
sortw(1,mid1);
sortw(mid1+1,br);
int mid2 = mid1/2;
sortw(1,mid2);
sortw(mid2+1,mid1);
int mid3 = (mid1+br)/2;
sortw(mid1+1,mid3);
sortw(mid3+1,br);
int mid4 = mid2/2;
sortw(1,mid4);
sortw(mid4+1,mid2);


int mid5 = (mid2+mid1)/2;
sortw(mid2+1,mid5);
sortw(mid5+1,mid1);


int mid6 = (mid1+mid3)/2;
sortw(mid1+1,mid6);
sortw(mid6+1,mid3);


int mid7 = (mid3+br)/2;
sortw(mid3+1,mid7);
sortw(mid7+1,br);


/////////////////
int mid8 = mid4/2;
p[1] = calcav(1,mid8,1);
p[2] = calcav(mid8+1,mid4,2);
int mid9 = (mid4+mid2)/2;
p[3] = calcav(mid4+1,mid9,3);
p[4] = calcav(mid9+1,mid2,4);
int mid10 = (mid2+mid5)/2;
p[5] = calcav(mid2+1,mid10,5);
p[6] = calcav(mid10+1,mid5,6);
int mid11 = (mid5+mid1)/2;
p[7] = calcav(mid5+1,mid11,7);
p[8] = calcav(mid11+1,mid1,8);
int mid12 = (mid1+mid6)/2;
p[9] = calcav(mid1+1,mid12,9);
p[10] = calcav(mid12+1,mid6,10);
int mid13 = (mid6+mid3)/2;
p[11] = calcav(mid6+1,mid13,11);
p[12] = calcav(mid13+1,mid3,12);
int mid14 = (mid3+mid7)/2;
p[13] = calcav(mid3+1,mid14,13);
p[14] = calcav(mid14+1,mid7,14);
int mid15 = (mid7+br)/2;
p[15] = calcav(mid7+1,mid15,15);
p[0] = calcav(mid15+1,br,0);
     n = h;
     m = w1;
    /// read_data
    int k = -1;
   checkforbest();
while(float( clock () - begin_time ) /  CLOCKS_PER_SEC<Final_Time&&k<12){
        mindist = MD[k];
k++;
        clock_t curr_time = clock();

while(float( clock () - begin_time ) /  CLOCKS_PER_SEC<Final_Time&&float( clock () - curr_time ) /  CLOCKS_PER_SEC<Time_Per_Test){
       // for(i=0;i<clrs;i++)
      //  cout<<i<<":  "<<p[i].r<<" "<<p[i].g<<" "<<p[i].b<<endl;
//cout<<"************"<<endl<<"************"<<endl;
for(i=1;i<=n;i++)
    for(j=1;j<=m;j++)
{
    id[i][j] = findandupdatecolor(s[i][j]);
}checkforbest();
}
   for(i=0;i<clrs;i++)num[i]=1;
makerandomcolors();
}
int br = 0;
int z;
for(i=1;i<=n;i++)
{
    for(j=1;j<=m;j++)
{
    z=0;
    if(ansid[i-1][j]==ansid[i][j])k++;
       if(ansid[i+1][j]==ansid[i][j])k++;
          if(ansid[i][j-1]==ansid[i][j])k++;
             if(ansid[i][j+1]==ansid[i][j])k++;
             if(k>=2)br++;
}
}
    ///print_data
    for(i=0;i<16;i++)
      cout<<ansp[i].r<<" "<<ansp[i].g<<" "<<ansp[i].b<<endl;
     // if(br<(n*m/2))cout<<"0 0 0"<<endl;
   //   else
    //    cout<<"255 255 255"<<endl;
    for(i=1;i<=n;i++){
        for(j=1;j<=m;j++)
        cout<<ansid[i][j]<<" ";
        cout<<endl;
    }
    /// print_data

}
colors calcaverage(int x, int y)
{
    int br = 5;
    colors k;
    k.r=5*p[id[x][y]].r;
    k.g=5*p[id[x][y]].g;
    k.b=5*p[id[x][y]].b;
    if(x>1)
    {
        k.r+=p[id[x-1][y]].r;
        k.g+=p[id[x-1][y]].g;
        k.b+=p[id[x-1][y]].b;
        br++;
    }
    if(x<n)
    {
        k.r+=p[id[x+1][y]].r;
        k.g+=p[id[x+1][y]].g;
        k.b+=p[id[x+1][y]].b;
        br++;
    }
    if(y>1)
    {
        k.r+=p[id[x][y-1]].r;
        k.g+=p[id[x][y-1]].g;
        k.b+=p[id[x][y-1]].b;
        br++;
    }
    if(y<m)
    {
        k.r+=p[id[x][y+1]].r;
        k.g+=p[id[x][y+1]].g;
        k.b+=p[id[x][y+1]].b;
        br++;
    }
    k.r = k.r/br;
    k.g  = k.g/br;
    k.b = k.b/br;
    return k;
}
void solvesecondcase()
{
     /// read_data

    int i,j;
    for(i=0;i<16;i++)
    {
        cin>>p[i].r>>p[i].g>>p[i].b;
    }
 int w,h;
    cin>>w>>h;
    for(i=1;i<=h;i++)
    {
        for(j=1;j<=w;j++)
        {
           cin>>id[i][j];
        }
    }
     n = h;
     m = w;
    /// read_data
/*for(i=2;i<n;i++)
{
    for(j=2;j<m;j++)
    {
        if(id[i-1][j]==id[i+1][j])id[i][j]=id[i-1][j];
        else
            if(id[i][j-1]==id[i][j+1])id[i][j]=id[i][j-1];
    }
}*/
    ///print_data

    for(i=1;i<=n;i++){
        for(j=1;j<=m;j++)
        {
            //if(p[15].r==0){
          colors k = calcaverage(i,j);
          cout<<k.r<<" "<<k.g<<" "<<k.b<<endl;//}else
        //  cout<<p[id[i][j]].r<<" "<<p[id[i][j]].g<<" "<<p[id[i][j]].b<<" ";

        }

        cout<<endl;
    }
    /// print_data
}
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(NULL);
freopen("imrec.in","r",stdin);
freopen("imrec.out","w",stdout);
int fl;
cin>>fl;
//cout<<fl<<endl;
if(fl==0)solvefirstcase();
else
    solvesecondcase();


return 0;