题解

#include<bits/stdc++.h>
#define ll long long
using namespace std;
const ll NM=1e3+10;
const ll MN=1e4+10;
ll a[NM][NM];
ll dp[MN];
int main(){
	ll T,N,M;
    cin>>T>>N>>M;
    for(ll i=1;i<=T;i++){
        for(ll j=1;j<=N;j++){
            cin>>a[i][j];
        }
    }
    for(ll k=1;k<T;k++){
		memset(dp,0,sizeof dp);
		for (ll i=1;i<=N ;i++){
			for (ll j=a[k][i];j<=M;j++){
				dp[j]=max(dp[j],dp[j-a[k][i]]+a[k+1][i]-a[k][i]);
			}
		}
		M+=dp[M];
	}
	cout<<M<<'\n';
	return 0;
}