#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
#define DUMP(x) cout << #x << " = " << (x) << endl;
#define FOR(i, m, n) for (ll i = m; i < n; i++)
#define IFOR(i, m, n) for (ll i = n - 1; i >= m; i--)
#define REP(i, n) FOR(i, 0, n)
#define IREP(i, n) IFOR(i, 0, n)
#define FOREACH(x, a) for (auto&(x) : (a))
#define ALL(v) (v).begin(), (v).end()
#define SZ(x) ll(x.size())

int main() {
  ll n, m, k;
  cin >> n >> m >> k;
  vector<vector<bool>> dp(n + 1, vector<bool>(k + 1, false));
  dp[0][0] = true;
  REP(i, n) {
    REP(j, m) {
      ll a;
      cin >> a;
      REP(l, k + 1) if (dp[i][l] && l + a <= k) { dp[i + 1][l + a] = true; }
    }
  }
  IFOR(i, 1, k + 1) {
    if (dp[n][i]) {
      cout << k - i << endl;
      return 0;
    }
  }
  cout << -1 << endl;
}