#include "bits/stdc++.h" #define REP(i, n) for(int i = 0; i < int(n); i++) #define FOR(i,n,m) for(int i = int(n); i < int(m); i++) using namespace std; typedef long long ll; const int MOD = 1e9 + 7; const int INF = 1e9 + 6; const ll LLINF = 1e18 + 1; int main() { int n, m,k; cin >> n >> m >> k; vector> a(n, vector(m)); REP(i, n) REP(j, m) cin >> a[i][j]; // dp[i][j] : iまででj円つくれるか vector> dp(n+1, vector(k+1,false)); dp[0][0] = true; REP(i, n) { REP(j, m) { REP(l, k+1) { if (l - a[i][j] >= 0 && dp[i][l - a[i][j]]) { dp[i + 1][l] = true; } } } } for (int i = k; i >= 0; i--) { if (dp[n][i]) { cout << k - i << endl; break; } else if (i == 0) { cout << -1 << endl; } } return 0; }