#include <cstdio>
#include <cstring>
#include <algorithm>
using namespace std;
int f[11][11][11][2049],a[11][11][11],b[11][11][11];
int h[100001][2],c[11],spfa[11][11],tr[11][11][11];
int way[5][3];
int i,j,k,m,n,o,p,l,s,t,H,r,ans;
void Shortest_Path_Faster_Algorithm()
{
while (l<r)
{
l++;
int x=h[l][0],y=h[l][1];
for (int k=1;k<=4;k++)
{
int xx=x+way[k][1],yy=y+way[k][2];
if (xx<=0||yy<=0||xx>n||yy>m) continue;
if (f[i][x][y][s]+a[i][xx][yy]<f[i][xx][yy][s])
{
f[i][xx][yy][s]=f[i][x][y][s]+a[i][xx][yy];
if (!spfa[xx][yy]) spfa[xx][yy]=true,h[++r][0]=xx,h[r][1]=yy;
}
}
spfa[x][y]=false;
}
}
int main()
{
freopen("treasure.in","r",stdin);
freopen("treasure.out","w",stdout);
scanf("%d%d%d",&H,&n,&m);
for (i=1;i<=H;i++)
for (j=1;j<=n;j++)
for (k=1;k<=m;k++)
scanf("%d",&a[i][j][k]);
for (i=1;i<=H;i++)
{
scanf("%d",&c[i]);
for (j=1;j<=c[i];j++) scanf("%d%d",&b[i][j][0],&b[i][j][1]),tr[i][b[i][j][0]][b[i][j][1]]=j;
c[i]+=(i>1);//对于第i层(i!=1),多开一个宝藏位
}
memset(f,60,sizeof(f));way[1][1]=1,way[1][2]=0,way[2][1]=0,way[2][2]=1,way[3][1]=-1,way[3][2]=0,way[4][1]=0,way[4][2]=-1;
for (i=1;i<=H;i++)
{
if (i==2)
{
int gawra=0;
}
for (j=1;j<=n;j++)
for (k=1;k<=m;k++)
if (tr[i][j][k]) f[i][j][k][1<<(tr[i][j][k]-1)]=a[i][j][k];
else f[i][j][k][0]=a[i][j][k];
for (s=0;s<=(1<<c[i])-1;s++)
{
l=0,r=0;
for (j=1;j<=n;j++)
for (k=1;k<=m;k++)
{
for (t=s&(s-1);t;t=s&(t-1))
f[i][j][k][s]=min(f[i][j][k][s],f[i][j][k][t]+f[i][j][k][s-t]-a[i][j][k]);
if (f[i][j][k][s]<1e9) h[++r][0]=j,h[r][1]=k,spfa[j][k]=true;
}
Shortest_Path_Faster_Algorithm();
if (s==(1<<c[i])-1)
{
for (j=1;j<=n;j++)
for (k=1;k<=m;k++)
{
if (f[i][j][k][s]>1e9||(i==H)) continue;
if (tr[i+1][j][k])
f[i+1][j][k][(1<<(c[i+1]-1))|(1<<(tr[i+1][j][k]-1))]=f[i][j][k][s]+a[i+1][j][k];//注意因为下一层对应位可能有宝藏,要与“超级宝藏”异或一下
else
f[i+1][j][k][(1<<(c[i+1]-1))]=f[i][j][k][s]+a[i+1][j][k];//将此层答案转移到下一层的“超级宝藏”
}
}
}
}
ans=1e9,s=(1<<c[H])-1;
for (i=1;i<=n;i++)
for (j=1;j<=m;j++)
ans=min(ans,f[H][i][j][s]);
printf("%d\n",ans);
}