#include <bits/stdc++.h>
using namespace std;
const int N = 105;
const int M = 1005;
int dp[N][M];
int p[N][N];
int w[N], c[N];
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 >> p[i][j];
}
}
for(int i = 1; i < t; i++){
for(int j = 1; j <= n; j++){
w[j] = p[i][j];
c[j] = p[i + 1][j] - p[i][j];
for(int k = 1; k <= n; k++){
for(int l = 1; l <= m; l++){
if(l < w[k]){
dp[k][l] = dp[k - 1][l];
}else{
int num1, num2;
num1 = dp[k - 1][l];
num2 = dp[k][l - w[k]] + c[k];
dp[k][l] = max(num1, num2);
}
}
}
}
m += dp[n][m];
}
cout << m;
return 0;
}