完全背包

#include<iostream>
#include<fstream>
#include<iomanip>
#include<cstdio>
#include<cstring>
#include<cmath>
#include<algorithm>
#include<string>
//#pragma GCC optimize(2)//O2优化
//#pragma GCC optimize(3)//O3优化
//f6停止程序
#define LL long long
using namespace std;
const int N=1e3+10;
const int Inf=0x3f3f3f3f;
LL t,n,m,p[105][105],f[10005]; 
int main(){
// 	freopen("xxx.in","r",stdin);
//	freopen("xxx.out","w",stdout);
	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-1;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];
	}cout<<m<<endl;
	return 0;
}