#include <bits/stdc++.h>
using namespace std;
using ll=long long;
const ll ILL=2167167167167167167;
const int INF=2100000000;
#define rep(i,a,b) for (int i=(int)(a);i<(int)(b);i++)
#define all(p) p.begin(),p.end()
template<class T> using _pq = priority_queue<T, vector<T>, greater<T>>;
template<class T> int LB(vector<T> &v,T a){return lower_bound(v.begin(),v.end(),a)-v.begin();}
template<class T> int UB(vector<T> &v,T a){return upper_bound(v.begin(),v.end(),a)-v.begin();}
template<class T> bool chmin(T &a,T b){if(b<a){a=b;return 1;}else return 0;}
template<class T> bool chmax(T &a,T b){if(a<b){a=b;return 1;}else return 0;}
template<class T> void So(vector<T> &v) {sort(v.begin(),v.end());}
template<class T> void Sore(vector<T> &v) {sort(v.begin(),v.end(),[](T x,T y){return x>y;});}
bool yneos(bool a,bool upp=false){if(a){cout<<(upp?"YES\n":"Yes\n");}else{cout<<(upp?"NO\n":"No\n");}return a;}
template<class T> void vec_out(vector<T> &p,int ty=0){
    if(ty==2){cout<<'{';for(int i=0;i<(int)p.size();i++){if(i){cout<<",";}cout<<'"'<<p[i]<<'"';}cout<<"}\n";}
    else{if(ty==1){cout<<p.size()<<"\n";}for(int i=0;i<(int)(p.size());i++){if(i) cout<<" ";cout<<p[i];}cout<<"\n";}}
template<class T> T vec_min(vector<T> &a){assert(!a.empty());T ans=a[0];for(auto &x:a) chmin(ans,x);return ans;}
template<class T> T vec_max(vector<T> &a){assert(!a.empty());T ans=a[0];for(auto &x:a) chmax(ans,x);return ans;}
template<class T> T vec_sum(vector<T> &a){T ans=T(0);for(auto &x:a) ans+=x;return ans;}
int pop_count(long long a){int res=0;while(a){res+=(a&1),a>>=1;}return res;}
template<class T> T square(T a){return a * a;}



void solve();
// POP'N ROLL MUSIC / TOMOO
int main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);

    int t = 1;
    // cin >> t;
    rep(i, 0, t) solve();
}

void solve(){
    ll H, W, K;
    cin >> H >> W >> K;
    vector A(H, vector<ll>(W));
    vector B(H, vector<int>(W));
    rep(i, 0, H) rep(j, 0, W) cin >> A[i][j];
    rep(i, 0, H) rep(j, 0, W) cin >> B[i][j];
    ll ans = 0;
    vector S(H + 1, vector<ll>(W + 1));
    rep(i, 0, H) rep(j, 0, W) S[i + 1][j + 1] = A[i][j];
    rep(i, 0, H + 1) rep(j, 0, W) S[i][j + 1] += S[i][j];
    rep(i, 0, H) rep(j, 0, W + 1) S[i + 1][j] += S[i][j];
    vector X(H, vector<int>(2, INF)), Y(W, vector<int>(2, INF));
    auto upd = [&](vector<int> &v, int a) -> void {
        chmin(v[1], a);
        if (v[0] > v[1]) swap(v[0], v[1]);
    };
    rep(i, 0, H) rep(j, 0, W) upd(X[i], B[i][j]), upd(Y[j], B[i][j]);
    rep(i, 0, H) rep(j, 0, W){
        ll P = S[i + 1][W] - S[i][W];
        ll Q = S[H][j + 1] - S[H][j];
        int c = B[i][j];
        int a = X[i][0];
        int b = Y[j][0];
        if (c == a) a = X[i][1];
        if (c == b) b = Y[j][1];
        if (c <= min(a, b)){
            chmax(ans, (P + (K >> c)) * (Q + (K >> c)));
        }
        else if (c > max(a, b)){
            if (a > b){
                swap(a, b);
                swap(P, Q);
            }
            auto f = [&](ll x) -> ll {
                ll y = ((K - (x << b)) >> a);
                return (P + y) * (Q + x);
            };
            ll L = 0, R = (K >> b);
            while (R - L > 5){
                ll m1 = (L * 2 + R) / 3;
                ll m2 = (L + R * 2) / 3;
                if (f(m1) < f(m2)) L = m1;
                else R = m2;
            }
            rep(i, L, R + 1) chmax(ans, f(i));
        }
        else{
            if (a >= c){
                swap(P, Q);
                swap(b, a);
            }
            assert(a < c);
            auto f = [&](ll x) -> ll {
                ll y = ((K - (x << c)) >> a);
                return (P + y + x) * (Q + x);
            };
            ll L = 0, R = (K >> c);
            while (R - L > 5){
                ll m1 = (L * 2 + R) / 3;
                ll m2 = (L + R * 2) / 3;
                if (f(m1) < f(m2)) L = m1;
                else R = m2;
            }
            rep(i, L, R + 1) chmax(ans, f(i));
        }
    }
    cout << ans << "\n";
}
/*
 * 行と列を fix して考えてみる
 * 真ん中を上げるか、それ以外の列、行を選んで上げるか
 * (X + a + c)(Y + b + c) = XY + Ya + Xb + ba + c(X + a + Y + b + c)
 * 真ん中の要素の B が最大のとき、そいつを 1 上げるより、他二つを上げた方がいい
 * このとき、大きい方をあげる回数を三分探索すればいい
 * 最小のときもそいつを上げ続けるとして良い
 * 真ん中のときも同様で、
 * 三分探索すればいい
 */