#include<bits/stdc++.h>

using namespace std;

int n,m,k;

vector<int>v[];

int A[],L[],h[];

int D[][];

int f[];

int main()

{

    scanf("%d%d%d",&n,&m,&k);

    for(int i=;i<=m;i++) scanf("%d",&A[i]);

    for(int i=;i<=m;i++)

    {

        while(A[i]--)

        {

            int x; scanf("%d",&x);

            v[i].push_back(x);

        }

    }

    for(int i=;i<=k;i++) scanf("%d",&L[i]),h[L[i]]=;

    for(int i=;i<=k;i++) for(int j=;j<=k;j++) scanf("%d",&D[L[i]][L[j]]);

    for(int i=m;i>=;i--)

    {

        int last = ;

        int now = ;

        while()

        {

            if(now==v[i].size()) break;

            while()

            {

                if(h[v[i-][last]]==) last++;

                else break;

            }

            f[v[i][now]] = v[i-][last]; now++;

            while()

            {

                if(now==v[i].size()) break;

                if(D[v[i][now]][v[i][now-]]!=) {last++; break;}

                f[v[i][now]] = v[i-][last]; now++;

            }

        }

        for(int j=;j<v[i].size();j++)

            for(int t=;t<v[i].size();t++)

                D[f[v[i][j]]][f[v[i][t]]]=D[v[i][j]][v[i][t]]-;

        for(int j=;j<v[i].size();j++)

            for(int t=;t<=k;t++)

                D[f[v[i][j]]][L[t]]=D[L[t]][f[v[i][j]]]=D[v[i][j]][L[t]]-;

    }

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

    {

        printf("%d",f[i]);

        if(i<n) printf(" ");

        else printf("\n");

    }

    return ;

}