#include<bits/stdc++.h>

using namespace std;

const int N = , M = 1e4+;

int n, m, k;

int h[N][M], t[N][M];

int dp[N][M];

int q[M];

//#define LOCAL

int main()

{

#ifdef LOCAL

    freopen("in.txt","r",stdin);

#endif

    while(scanf("%d%d%d", &n, &m, &k), n+m+k){

        n++;

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

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

                scanf("%d",h[i]+j);

                h[i][j] += h[i][j-];

            }

        }

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

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

                scanf("%d",t[i]+j);

                t[i][j] += t[i][j-];

            }

        }

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

            #define maintain(diff) while(hd<rl && diff(j,q[hd]) > k) hd++;

            #define inst(val) while(hd<rl && val(q[rl-1]) <= val(j)) rl--; q[rl++] = j;

            int hd = , rl = ;

            #define dis(x) (t[i][x])

            #define lval(x) (dp[i-1][x] - h[i][x])

            #define ldis(j,k) dis(j)-dis(k)

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

                inst(lval)

                maintain(ldis)

                dp[i][j] = lval(q[hd])+h[i][j];

            }

            hd = rl = ;

            #define rval(x) (dp[i-1][x] + h[i][x])

            #define rdis(j,k) dis(k)-dis(j)

            for(int j = m; j >= ; j--){

                inst(rval)

                maintain(rdis)

                dp[i][j] = max(dp[i][j],rval(q[hd])-h[i][j]);

            }

        }

        int ans = ;

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

            ans = max(ans,dp[n][j]);

        }

        printf("%d\n",ans);

    }

    return ;

}