hdu 5234

#include<iostream>
#include<cstdio>
#include<cstring>
#include<cstdlib>
#include<cmath>
#include<cctype>
#include<queue>
#include<stack>
#include<vector>
#include<algorithm>

using namespace std;
typedef long long LL;
#define N 110
#define INF 0x3f3f3f3f

int n, m, k;
int a[N][N], dp[N][N][N];

int main()
{
    while(~scanf("%d%d%d", &n, &m, &k))
    {
        for(int i=1; i<=n; i++)
        for(int j=1; j<=m; j++)
            scanf("%d", &a[i][j]);

        memset(dp, 0, sizeof(dp));

        for(int i=1; i<=n; i++)
        {
            for(int j=1; j<=m; j++)
            {
               for(int l=k; l>=a[i][j]; l--)
               { 
                   int x=max(dp[i][j-1][l], dp[i-1][j][l]);
                   int y=max(dp[i][j-1][l-a[i][j]]+a[i][j], dp[i-1][j][l-a[i][j]]+a[i][j]);
                   dp[i][j][l]=max(x, y);
               } 
            }
        }
        printf("%d\n", dp[n][m][k]);
    }
    return 0;
}