#include <bits/stdc++.h>
using namespace std;
#define int long long
#define rep(i,n) for(int (i)=0;(i)<(n);(i)++)
#define rrep(i,n) for(int (i)=((n)-1);(i)>=0;(i)--)
#define itn int
#define all(x) (x).begin(),(x).end()
#define F first
#define S second
const long long INF = 1LL << 60;
const int MOD = 1000000007;
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return true; } return false; }
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return true; } return false; }
signed main(void){
    int n,m,K; cin>>n>>m>>K;
    vector <vector<int>> a(n,vector <int>(m));
    rep(i,n){
        rep(j,m) cin>>a[i][j];
    }
    vector <vector<int>> dp(n+1,vector <int>(501));
    dp[0][0] = 1;
    rep(i,n){
        rep(j,m){
            rep(k, 501){
                if(dp[i][k] && a[i][j] + k <= 500) dp[i + 1][k + a[i][j]] = 1;
            }
        }
    }
    int ans = K+1;
    for(int i = K;i>=0;i--){
        if(dp[n][i]) {ans = i; break;}
    }
    
    cout<<K - ans<<endl;
}