#include<bits/stdc++.h>
#define REP(i,n) for(int i=0,i##_len=(n);i<i##_len;++i)
#define rep(i,a,b) for(int i=int(a);i<int(b);++i)
#define All(x) (x).begin(),(x).end()
using namespace std;
typedef long long ll;

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<bool>> dp(N+1,vector<bool>(K+1,false));
    dp[0][K]=true;
    REP(i,N) REP(j,K+1){
        REP(k,M){
            if(j-A[i][k]>=0) dp[i+1][j-A[i][k]]=dp[i+1][j-A[i][k]]|dp[i][j];
        }
    }
    int ans=K+1;
    REP(i,K+1) if(dp[N][i]) ans=min(ans,i);
    if(ans==K+1) cout<<-1<<endl;
    else cout<<ans<<endl;
}