#include <iostream>
#include <array>
#include <algorithm>
#include <vector>
#include <set>
#include <unordered_set>
#include <cmath>
#include <complex>
#include <deque>
#include <iterator>
#include <numeric>
#include <map>
#include <unordered_map>
#include <queue>
#include <stack>
#include <string>
#include <tuple>
#include <utility>
#include <limits>
#include <iomanip>
using namespace std;

using ll=long long;
template<class T> using V = vector<T>;
template<class T, class U> using P = pair<T, U>;
using vll = V<ll>;
using vvll = V<vll>;
#define rep(i, k, n) for (ll i=k; i<(ll)n; ++i)
#define REP(i, n) rep(i, 0, n)
#define ALL(v) v.begin(),v.end()
template<class T> inline bool chmax(T& a, T b) {if (a<b) {a=b; return true;} return false;}
template<class T> inline bool chmin(T& a, T b) {if (a>b) {a=b; return true;} return false;}
#define DEBUG_VLL(vec) REP(cval, vec.size()) cerr<<vec[cval]<<(cval==vec.size()-1?'\n':' ');

const ll MOD = 1000000007;
const ll HIGHINF = (ll)1e18;

int main() {
    cin.tie(0);
    ios::sync_with_stdio(false);
    ll n, m, k; cin >> n >> m >> k;
    V<vvll> dp(n+1, vvll(m, vll(505, 0)));
    for (ll i=0; i<m; i++) dp[0][i][0] = 1;

    rep(i, 1, n+1) {
        REP(j, m) {
            ll a; cin >> a;
            REP(pm, m) {
                rep(l, a, 505) {
                    if (dp[i-1][pm][l-a] == 1) dp[i][j][l] = 1;
                }
            }
        }
    }
    
    ll ans = k;
    REP(j, m) {
        REP(l, k+1) {
            if (dp[n][j][l] == 1) chmin(ans, k-l);
        }
    }
    if (ans == k) cout << "-1\n";
    else cout << ans << '\n';
    return 0;
}