#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
template<class T>bool chmax(T &a, const T &b) { if (a<b) { a=b; return true; } return false; }
template<class T>bool chmin(T &a, const T &b) { if (b<a) { a=b; return true; } return false; }
#define vi vector<int>
#define vl vector<ll>
#define vii vector<pair<int,int>>
#define vll vector<pair<ll,ll>>
#define vvi vector<vector<int>>
#define vvl vector<vector<ll>>
#define vvii vector<vector<pair<int,int>>>
#define vvll vector<vector<pair<ll,ll>>>
#define vst vector<string>
#define pii pair<int,int>
#define pll pair<ll,ll>
#define pb push_back
#define all(x) (x).begin(),(x).end()
#define mkunique(x) sort(all(x));(x).erase(unique(all(x)),(x).end())
#define fi first
#define se second
#define mp make_pair
#define si(x) int(x.size())
const int mod=998244353,MAX=300005,INF=15<<26;

int main(){
    
    std::ifstream in("text.txt");
    std::cin.rdbuf(in.rdbuf());
    cin.tie(0);
    ios::sync_with_stdio(false);
    
    ll H,W,K;cin>>H>>W>>K;
    vvl A(H,vl(W));
    vl S(H),T(W);
    for(int i=0;i<H;i++){
        for(int j=0;j<W;j++){
            cin>>A[i][j];
            S[i]+=A[i][j];
            T[j]+=A[i][j];
        }
    }
    vvl B(H,vl(W));
    vl miH(H,33),miW(W,33);
    for(int i=0;i<H;i++){
        for(int j=0;j<W;j++){
            cin>>B[i][j];
            chmin(miH[i],B[i][j]);
            chmin(miW[j],B[i][j]);
        }
    }
    
    
    ll ans=0;
    
    for(int i=0;i<H;i++){
        for(int j=0;j<W;j++){
            ll x=S[i],y=T[j];
            ll a=33,b=33,c=33;
            c=B[i][j];
            a=miH[i];
            b=miW[j];
            
            if(c<=a&&c<=b){
                ll can=K/(1LL<<c);
                chmax(ans,(x+can)*(y+can));
            }else{
                ll l=0,r=K/(1LL<<a);
                
                auto f=[&](ll m){
                    ll xx=x,yy=y,rem=K-(1LL<<a)*m;
                    if(a<c){
                        xx+=m;
                    }else{
                        xx+=m;
                        yy+=m;
                    }
                    m=rem/(1LL<<b);
                    if(b<c){
                        yy+=m;
                    }else{
                        xx+=m;
                        yy+=m;
                    }
                    return xx*yy;
                };
                
                while(r-l>2){
                    ll m1=(l+l+r)/3,m2=(l+r+r)/3;
                    ll x1=f(m1),x2=f(m2);
                    chmax(ans,x1);
                    chmax(ans,x2);
                    if(x1>x2) r=m2;
                    else l=m1;
                }
                for(ll m=l-30;m<=r+30;m++){
                    if(0<=m&&m<=K/(1LL<<a)){
                        chmax(ans,f(m));
                    }
                }
            }
        }
    }
    cout<<ans<<endl;
}