#include <bits/stdc++.h>
using namespace std;
int t, a, b, c[103][103], dp[1005];
int main(){
    scanf("%d%d%d", &t, &a, &b);
    for (int i = 1; i <= t; i++) {
        for (int j = 1; j <= a; j++) {
            scanf("%d", &c[i][j]);
        }
    }
    for (int k = 1; k < t; k++) {
        for (int i = 0; i <= b; i++) {
            dp[i] = i;
        }
        for (int i = 1; i <= a; i++) {
            for (int j = c[k][i]; j <= b; j++ ){
                dp[j] = max(dp[j], dp[j - c[k][i]] + c[k + 1][i]);
            }
        }
        b = dp[b];
    }
    printf("%d", b);
    return 0;
}