//
// Created by yamunaku on 2019/10/25.
//

#include <bits/stdc++.h>

using namespace std;

#define rep(i, n) for(int i = 0; i < (n); i++)
#define repl(i, l, r) for(int i = (l); i < (r); i++)
#define per(i, n) for(int i = ((n)-1); i >= 0; i--)
#define perl(i, l, r) for(int i = ((r)-1); i >= (l); i--)
#define all(x) (x).begin(),(x).end()
#define MOD9 998244353
#define MOD1 1000000007
#define IINF 1000000000
#define LINF 1000000000000000000
#define SP <<" "<<
#define CYES cout<<"Yes"<<endl
#define CNO cout<<"No"<<endl
#define CFS cin.tie(0);ios::sync_with_stdio(false)
#define CST(x) cout<<fixed<<setprecision(x)

typedef long long ll;
typedef long double ld;
typedef vector<int> vi;
typedef vector<vector<int>> mti;
typedef vector<ll> vl;
typedef vector<vector<ll>> mtl;

int main(){
    int n, m, k;
    cin >> n >> m >> k;
    vi dp(k + 1, false);
    dp[0] = true;
    int sum = 0;
    rep(i, n){
        vi ndp(k + 1, false);
        int mi = IINF;
        rep(j, m){
            int x;
            cin >> x;
            mi = min(mi, x);
            repl(l, x, k + 1){
                ndp[l] |= dp[l - x];
            }
        }
        sum += mi;
        dp = ndp;
    }
    if(sum > k){
        cout << -1 << endl;
        return 0;
    }
    per(i, k + 1) if(dp[i]){
            cout << k - i << endl;
            return 0;
        }
    return 0;
}