#include <bits/stdc++.h>
#define rep(i,n) for(int i=0;i<n;i++)
using namespace std;
typedef long long ll;
typedef pair<ll,int> P;
const int INF = 1e9;
const int MOD = 1000000007;

int main(){
    int n,m,k;
    cin >> n >> m >> k;
    vector<vector<int>> a(n,vector<int>(m,0));
    rep(i,n)rep(j,m) cin >> a[i][j];
    vector<vector<int>> dp(n+1,vector<int>(k+1,0));
    dp[0][0] = 1;
    for(int i=1;i<=n;i++){
        rep(j,k+1){
            for(int p:a[i-1]){
                if( j - p >= 0){
                    dp[i][j] += dp[i-1][j-p];
                }
            }
        }
    }

    for(int i=k;i>=0;i--){
        if(dp[n][i] > 0){
            cout << k-i << endl;
            return 0;
        }
    }
    cout << -1 << endl;
}