#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<int, int>;
using T = tuple<int, int, int>;
#define al(a) a.begin(), a.end()
#define ral(a) a.rbegin(), a.rend()
#define sz(a) (int)a.size()
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rrep(i, n) for (int i = 1; i <= (n); ++i)
#define drep(i, n) for (int i = (n)-1; i >= 0; --i)
#define db(a, b) cout << #a << ": " << a << " " << #b << ": " << b << endl;

int main() {
  int n, m, K;
  cin >> n >> m >> K;
  vector a(n, vector<int>(m));
  rep(i, n) rep(j, m) { cin >> a[i][j]; }

  vector<int> dp(K + 1, -1);
  dp[0] = 1;
  rep(i, n) {
    vector<int> p(K + 1, -1);
    swap(p, dp);
    rep(j, m) {
      rep(k, K) {
        if (p[k] == -1) continue;
        if (k + a[i][j] > K) break;
        dp[k + a[i][j]] = p[k];
      }
    }
  }
  const int INF = 1001001001;
  int ans = INF;
  rrep(i, K) {
    // db(i, dp[i]);
    if (dp[i] != -1) ans = min(ans, K - i);
  }
  if (ans == INF) ans = -1;
  cout << ans << endl;
  return 0;
}