/*** author: yuji9511 ***/
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll,ll> lpair;
const ll MOD = 1e9+7;
const ll INF = 1e18;
#define rep(i,m,n) for(ll i=(m);i<(n);i++)
#define rrep(i,m,n) for(ll i=(m);i>=(n);i--)
#define printa(x,n) for(ll i=0;i<n;i++){cout<<(x[i])<<" \n"[i==n-1];};
void print() {}
template <class H,class... T>
void print(H&& h, T&&... t){cout<<h<<" \n"[sizeof...(t)==0];print(forward<T>(t)...);}

int main(){
    cin.tie(0);
    ios::sync_with_stdio(false);
    ll n,m,k;
    cin >> n >> m >> k;
    ll a[11][11];
    rep(i,0,n){
        rep(j,0,m){
            cin >> a[i][j];
        }
    }
    ll res = INF;
    ll dp[11][510] = {};
    dp[0][0] = 1;
    rep(i,0,n){
        rep(j,0,m){
            rep(l,0,501){
                if(l - a[i][j] >= 0) dp[i+1][l] += dp[i][l - a[i][j]];
            }
        }
    }

    rrep(l,k,0){
        if(dp[n][l] > 0){
            print(k-l);
            return 0;
        }
    }
    print(-1);
    

}