#include<bits/stdc++.h>

using namespace std;

const int mod=1e9+;

const int N=+;

typedef long long ll;

int n,m,h;

ll ans[N];

int fa[N];

int now[N];

int fin(int x){

    if(fa[x]==x) return x;

    int ret=fin(fa[x]);

    fa[x]=ret;ans[x]=ans[ret];now[x]=now[ret];

    return ret;

}

int getnum(int x,int y){

    return (x-)*m+y;

}

struct node{

    int x,y;

    int val;

    bool friend operator <(node a,node b){

        return a.val<b.val;

    }

}e[*N];

int tot;

int main()

{

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

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

        for(int j=;j<=m-;j++){

            e[++tot].x=getnum(i,j);

            e[tot].y=getnum(i,j+);

            scanf("%d",&e[tot].val);

        }

    }

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

        for(int j=;j<=m;j++){

            e[++tot].x=getnum(i,j);

            e[tot].y=getnum(i+,j);

            scanf("%d",&e[tot].val);

        }

    }

    sort(e+,e+tot+);

    for(int i=;i<=n*m;i++){

        fa[i]=i;ans[i]=;

        now[i]=;

    }

    for(int i=;i<=tot;i++){

        int x=fin(e[i].x);

        int y=fin(e[i].y);

        if(x!=y){

            fa[x]=y;

            ans[y]=(ans[x]+e[i].val-now[x])*(ans[y]+e[i].val-now[y])%mod;

            now[y]=e[i].val;

        }

    }

    int ff=fin();

    ans[ff]=(ans[ff]+h-now[ff])%mod;

    printf("%lld",ans[ff]);

    return ;

}