#include<bits/stdc++.h>
using namespace std;
const int N = 1e2 + 3;
const int M = 1e4 + 4;
int a[N][N],f[M];
int t,n,m;
signed main(){
	
	cin >> t >> n >> m;
	
	for ( int i = 1; i <= t; i ++ ){
		for ( int j = 1; j <= n; j ++ ){
			cin >> a[i][j];
		}
	}
	
	for ( int k = 1; k < t; k ++ ){
		memset(f,0,sizeof f);		
		for ( int i = 1; i <= n; i ++ ){
			if ( a[k][i] - a[k - 1][i] > 0 ){
				for ( int j = a[i][k]; j <= m; j ++ ){
					f[j] = max ( f[j], f[j - a[i][k]] + a[i][k + 1] - a[i][k] );
				}
			}
			m += f[m];
		}
	}
	cout << m;
	
	return 0;
}