#include <bits/stdc++.h>

using namespace std;
const int N = 110;
int w[N][N], f[N][10010];
int main() {
    int t, n, m;
    cin >> t >> n >> m;
    for (int i = 1; i <= t; i++)
        for (int j = 1; j <= n; j++)
            cin >> w[i][j];

    for (int k = 1; k < t; k++) {
        memset(f, 0, sizeof f);
        for (int i = 1; i <= n; i++)
            for (int j = 1; j <= m; j++) {
                f[i][j] = f[i - 1][j];
                if (j >= w[k][i])
                    f[i][j] = max(f[i][j], f[i][j - w[k][i]] + w[k + 1][i] - w[k][i]);
            }
        m += f[n][m];
    }
    printf("%d\n", m);

    return 0;
}