#include<bits//stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define req(i,n) for(int i = 1;i <=  n; i++)
#define rrep(i,n) for(ll i = n-1;i >= 0;i--)
#define ALL(obj) begin(obj), end(obj)
#define RALL(a) rbegin(a),rend(a)
typedef long long int ll;
typedef long double ld;
const int MAX = 510000;
const ll MOD = 1000000007;
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }
const ll INF = 1e18;
int main(){
    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>(600,0));
    dp[0][k] = 1;
    rep(i,n){
        rep(j,k+1){
            if(dp[i][j]==0)continue;
            rep(l,m){
                if(j <a[i][l])continue;
                dp[i+1][j-a[i][l]] += dp[i][j];
            }   
        }
    }int ans = 1e9;
    rep(i,k+1){
        if(dp[n][i]>0) chmin(ans,i);
    }if(ans==1e9) cout << -1 << endl;
    else cout << ans <<endl;
}