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

const int INF = 1 << 30;

int main() {
    int N, M, K;
    cin >> N >> M >> K;
    vector<vector<int>> A(N, vector<int>(M));
    for(int i = 0; i < N; ++i) {
        for(int j = 0; j < M; ++j) cin >> A[i][j];
    }
    vector<int> dp(K + 1);
    dp[0] = 1;
    for(int i = 0; i < N; ++i) {
        vector<int> tmp(K + 1);
        for(int j = 0; j < M; ++j) {
            for(int k = K; k >= 0; --k) {
                if(k - A[i][j] >= 0) tmp[k] += dp[k - A[i][j]];
            }
        }
        swap(dp, tmp);
    }
    int ans = INF;
    for(int i = 1; i <= K ; ++i) {
        if(dp[i]) ans = min(ans, K - i);
    }
    if(ans == INF) ans = -1;
    cout << ans << '\n';
    return 0;
}