#include<iostream>
#include<string>
#include<vector>
#include<algorithm>
#include<map>
#include<set>
#include<cstdio>
#include<cmath>
#include<numeric>
#include<queue>
#include<stack>
#include<cstring>
#include<limits>
#include<functional>
#include<unordered_set>
#include<iomanip>
#include<cassert>
#define rep(i,a) for(int i=(int)0;i<(int)a;++i)
#define pb push_back
#define eb emplace_back
using ll=long long;
constexpr ll mod = 1e9 + 7;
constexpr ll INF = 1LL << 50;
 
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;
}
using namespace std;

void solve(){
    int n,m,k;
    cin>>n>>m>>k;
    int a;
    vector<vector<bool>>dp(n+1,vector<bool>(k+1));
    dp[0][0]=true;
    rep(i,n){
        rep(j,m){
            cin>>a;
            for(int h=a;h<=k;++h){
                if(dp[i][h-a])dp[i+1][h]=true;
            }
        }
    }
    for(int i=k;i>=0;--i){
        if(dp[n][i]){
            cout<<k-i<<"\n";
            return;
        }
    }
    cout<<-1<<"\n";
}
 
 
signed main(){
	ios::sync_with_stdio(false);
        cin.tie(0);
	cout<<fixed<<setprecision(15);
	solve();
	return 0;
}