#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for(int(i) = 0; (i) < (n); (i)++)
#define FOR(i, m, n) for(int(i) = (m); (i) < (n); (i)++)
#define All(v) (v).begin(), (v).end()
#define pb push_back
#define MP(a, b) make_pair((a), (b))
template <class T> vector<T> make_vec(size_t a, T val) {
    return vector<T>(a, val);
}
template <class... Ts> auto make_vec(size_t a, Ts... ts) {
    return vector<decltype(make_vec(ts...))>(a, make_vec(ts...));
}
using ll = long long;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
using Graph = vector<vector<int>>;
template <typename T> struct edge {
    int to;
    T cost;
    edge(int t, T c) : to(t), cost(c) {}
};
template <typename T> using WGraph = vector<vector<edge<T>>>;
const int INF = 1 << 30;
const ll LINF = 1LL << 60;
const int MOD = 1e9 + 7;

int main() {
    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];
    auto dp = make_vec(N + 1, 510, 0);
    dp[0][0] = 1;
    for(int i = 0; i < N; i++) {
        for(int j = 0; j < 510; j++) {
            for(int k = 0; k < M; k++) {
                dp[i + 1][j + A[i][k]] |= dp[i][j];
            }
        }
    }
    int used = -1;
    for(int i = 0; i <= K; i++) {
        if(dp[N][i])
            used = max(used, i);
    }
    if(used == -1) {
        cout << -1 << endl;
    } else {
        cout << K - used << endl;
    }
}