#include <bits/stdc++.h>
#define rep(i, n) for(int i = 0; i < (int)n; i++)
using namespace std;
using ll = long long;
using P = pair<ll, ll>;

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];
    vector<bool> dp(k + 1, false);
    dp[0] = true;
    rep(i, n) {
        vector<bool> ndp(k + 1, false);
        rep(j, k + 1) rep(l, m) {
            if(j - a[i][l] >= 0 && dp[j - a[i][l]]) ndp[j] = true;
        }
        dp = ndp;
    }
    int ans = -1;
    rep(i, k + 1) if(dp[i]) ans = i;
    if(ans == -1) cout << -1 << endl;
    else cout << k - ans << endl;
    return 0;
}