#include<bits/stdc++.h>
#include<atcoder/all>
using namespace std;
using namespace atcoder;
typedef long long int ll;
typedef long double ld;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef vector<vl> vvl;
typedef vector<vvl> vvvl;
typedef vector<vvvl> vvvvl;
typedef vector<bool> vb;
typedef vector<vb> vvb;
typedef vector<vvb> vvvb;
typedef vector<vvvb> vvvvb;
typedef pair<ll,ll> pl;
typedef pair<ll,pl> ppl;
typedef pair<ll,ppl> pppl;
typedef pair<ll,pppl> pppppl;
#define rep(i,a,b) for(int i=(a);i<(b);i++)
#define rrep(i,a,b) for(int i=(b)-1;i>=(a);i--)
#define all(a) begin(a),end(a)
#define sz(a) (int)(a).size()
#define F first
#define S second
#define bs(A,x) binary_search(all(A),x)
#define lb(A,x) (ll)(lower_bound(all(A),x)-A.begin())
#define ub(A,x) (ll)(upper_bound(all(A),x)-A.begin())
#define cou(A,x) (ll)(upper_bound(all(A),x)-lower_bound(all(A),x))
template<typename T>using min_priority_queue=priority_queue<T,vector<T>,greater<T>>;
template<class T>bool chmax(T&a,T b){if(a<b){a=b;return 1;}return 0;}
template<class T>bool chmin(T&a,T b){if(b<a){a=b;return 1;}return 0;}
//*
using mint=modint998244353;
const ll mod=998244353;
//*/
/*
using mint=modint1000000007;
const ll mod=1000000007;
//*/
//using mint=modint;
//*
typedef vector<mint> vm;
typedef vector<vm> vvm;
typedef vector<vvm> vvvm;
typedef vector<vvvm> vvvvm;
ostream&operator<<(ostream&os,mint a){os<<a.val();return os;}
istream&operator>>(istream&is,mint&a){int x;is>>x;a=mint(x);return is;}
//*/
template<typename T1,typename T2>ostream&operator<<(ostream&os,pair<T1,T2>p){os<<p.F<<" "<<p.S;return os;}
template<typename T1,typename T2>istream&operator>>(istream&is,pair<T1,T2>&p){is>>p.F>>p.S;return is;}
template<typename T>ostream&operator<<(ostream&os,vector<T>v){rep(i,0,sz(v))os<<v[i]<<(i+1!=sz(v)?" ":"");return os;}
template<typename T>istream&operator>>(istream&is,vector<T>&v){for(T&in:v)is>>in;return is;}
ll op(ll a,ll b){return min(a,b);}
ll e(){return 1e18;}
int main(){
  cin.tie(0)->sync_with_stdio(0);
  cin.exceptions(cin.failbit);
  ll H,W,K;cin>>H>>W>>K;
  vvl A(H,vl(W)),B(H,vl(W));
  cin>>A>>B;
  vl X(H),Y(W);
  rep(i,0,H)rep(j,0,W)X[i]+=A[i][j],Y[j]+=A[i][j];
  vl S(H,30),T(W,30);
  rep(i,0,H)rep(j,0,W)chmin(S[i],B[i][j]),chmin(T[j],B[i][j]);
  ll ans=0;
  rep(i,0,H)rep(j,0,W){
    ll a=S[i],b=T[j],c=B[i][j];
    ll x=X[i],y=Y[j];
    if(a>b)swap(a,b),swap(x,y);
    if(a==b){
      ll q=K>>a;
      if(c==a)chmax(ans,(x+q)*(y+q));
      else{
        if(x>y)swap(x,y);
        if(y>=x+q)chmax(ans,(x+q)*y);
        else{
          q-=y-x;
          x=y;
          chmax(ans,(x+q/2)*(y+q-q/2));
        }
      }
    }
    else{
      ll q=K>>a;
      b-=a;c-=a;
      x+=q%(1ll<<b);
      q>>=b;
      if(c==b){
        //1コス で x+=2^b or x++,y++
        auto f=[&](ll k){
          return (x+(k<<b)+q-k)*(y+q-k);
        };
        ll l=0,r=q;
        while(r-l>10){
          ll m1=(2*l+r)/3,m2=(l+2*r)/3;
          if(f(l)>=f(m1))r=m1;
          else if(f(m2)<=f(r))l=m2;
          else if(f(m1)<=f(m2))l=m1;
          else r=m2;
        }
        rep(x,l,r+1)chmax(ans,f(x));
      }
      else{
        //1コス で x+=2^(b-a) or y++
        auto f=[&](ll k){
          return (x+(k<<b))*(y+q-k);
        };
        ll l=0,r=q;
        while(r-l>10){
          ll m1=(2*l+r)/3,m2=(l+2*r)/3;
          if(f(l)>=f(m1))r=m1;
          else if(f(m2)<=f(r))l=m2;
          else if(f(m1)<=f(m2))l=m1;
          else r=m2;
        }
        rep(x,l,r+1)chmax(ans,f(x));
      }
    }
  }
  cout<<ans<<endl;
  return 0;
}