#include<bits/stdc++.h>
using namespace std;
#define ALL(x) x.begin(),x.end()
#define rep(i,n) for(int i=0;i<(n);i++)
#define debug(v) cout<<#v<<":";for(auto x:v){cout<<x<<' ';}cout<<endl;
#define INF 1000000000
#define mod 1000000007
using ll=long long;
const ll LINF=1001002003004005006ll;
int dx[]={1,0,-1,0};
int dy[]={0,1,0,-1};
ll gcd(ll a,ll b){return b?gcd(b,a%b):a;}
template<class T>bool chmax(T &a,const T &b){if(a<b){a=b;return true;}return false;}
template<class T>bool chmin(T &a,const T &b){if(b<a){a=b;return true;}return false;}

signed main(){
    cin.tie(0);
    ios::sync_with_stdio(0);

    int h,w,k;cin>>h>>w>>k;
    vector<vector<int>> a(h,vector<int>(w));
    rep(i,h)rep(j,w) cin>>a[i][j];

    int sum=0;
    rep(i,h){
        sum+=*min_element(ALL(a[i]));
    }
    if(sum>k){
        cout<<-1<<endl;
        return 0;
    }

    bool dp[k+1]={};
    dp[0]=1;
    rep(i,h){
        bool dp_new[k+1]={};

        rep(j,w){
            for(int l=k;l>=0;l--){
                if(l+a[i][j]<=k and dp[l]) dp_new[l+a[i][j]]=true; 
            }
        }
        rep(j,k+1) dp[j]=dp_new[j];
    }
    for(int i=k;i>=0;i--){
        if(dp[i]){
            cout<<k-i<<endl;
            return 0;
        }
    }
    return 0;
}