#include <bits/stdc++.h>
using namespace std;

#define REP(i, m, n) for (int i = (m); i < (int)(n); i++)
#define REPS(i, m, n) for (int i = (m); i <= (int)(n); i++)
#define rep(i, n) REP(i, 0, n)
#define reps(i, n) for (int i = 0; i <= (int)(n); i++)
#define rrep(i, x) for (int i = ((int)(x)-1); i >= 0; i--)
#define rreps(i, x) for (int i = (int)(x); i >= 0; i--)
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define pb push_back
#define fi first
#define se second
typedef long long ll;
typedef pair<int, int> P;
const int inf = INT_MAX;
const ll INF = 1LL << 60;
const ll mod = 1e9 + 7;
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }
template<typename A, size_t N, typename T> void Fill(A (&array)[N], const T &val) { fill( (T*)array, (T*)(array+N), val ); }

bool dp[20][600];

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

    int N, M, K;
    cin >> N >> M >> K;
    vector<vector<int>> a(N, vector<int>(M));
    rep(i, N) rep(j, M) cin >> a[i][j];

    rep(i, M) dp[0][a[0][i]] = true;

    rep(i, N-1) {
        rep(j, M) {
            reps(k, 500) {
                chmax(dp[i+1][k+a[i+1][j]], dp[i][k]);
            }

        }
    }

    int cost = -1;
    reps(i, 500) {
        if (dp[N-1][i] && i <= K) {
            cost = max(cost, i);
        }
    }

    if (cost != -1) {
        cout << K - cost << endl;
    } else {
        cout << cost << endl;
    }

    return 0;
}