#include<bits/stdc++.h>
using namespace std;
const int MAXT=1010,MAXM=20010;
int t,n,m,p[MAXT][MAXT],f[MAXM];
int main(){
//	freopen("souvenir.in","r",stdin);
//	freopen("souvenir.out","w",stdout);
	scanf("%d%d%d",&t,&n,&m);
	for(int i=1;i<=t;++i){
		for(int j=1;j<=n;++j){
			scanf("%d",&p[i][j]);
		}
	} 
	for(int i=1;i<=t;++i){
		memset(f,0,sizeof f);
		for(int j=1;j<=n;++j){
			for(int k=p[i][j];k<=m;++k){
				f[k]=max(f[k],f[k-p[i][j]]+p[i+1][j]-p[i][j]);
			}
		}
		m+=f[m];
	}
	printf("%d",m);
	return 0;
}