#include #define rep(i,a,b) for(int i=a;i=b;i--) using namespace std; typedef long long ll; typedef pair P; ll INF = 1e18; int main(){ int N, M, K; cin >> N >> M >> K; bool dp[N+1][K+1]; rep(i,0,N+1) rep(j,0,K+1) dp[i][j] = false; dp[0][K] = true; int a; rep(i,1,N+1) rep(j,0,M){ cin >> a; rep(k,1,K+1){ if(dp[i-1][k] && k-a>=0){ dp[i][k-a] = true; } } } rep(i,0,K+1){ if(dp[N][i]){ cout << i << endl; return 0; } } cout << -1 << endl; return 0; }