#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
#define F first
#define S second
#define pii pair<int, int>
#define eb emplace_back
#define all(v) v.begin(), v.end()
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rep3(i, l, n) for (int i = l; i < (n); ++i)
#define sz(v) (int)v.size()
#define inf (int)(1e9+7)
#define abs(x) (x >= 0 ? x : -(x))
template<typename T1, typename T2> inline bool chmin(T1 &a, T2 b) { if (a > b) { a = b; return 1; } return 0; }
template<typename T1, typename T2> inline void chmax(T1 &a, T2 b) { if (a < b) a = b; }
template<typename T> inline T gcd(T a, T b) { if (b == 0) return a; return gcd(b, a % b); }






int main() {
    ios::sync_with_stdio(false);
    cin.tie(0);
    
    
    int n, m, K;
    cin >> n >> m >> K;
    int a[n][m];
    rep(i, n) rep(j, m) cin >> a[i][j];
    
    set<int> s;
    rep(i, m) s.insert(a[0][i]);
    rep3(i, 1, n) {
        set<int> s2;
        rep(j, m) {
            for (auto e : s) {
                s2.insert(e + a[i][j]);
            }
        }
        s = s2;
    }
    int ans = -1;
    for (auto e : s) {
        if (e > K) break;
        chmax(ans, e);
    }
    if (ans == -1) cout << -1 << endl;
    else cout << K - ans << endl;
}