#include <bits/stdc++.h>
using namespace std;
using ll = int64_t;
#define rep(i, s, e) for (long i = s; i < e; ++i)
#define asort(a) stable_sort(begin(a), end(a))
#define rsort(a) stable_sort(rbegin(a), rend(a))
#define sum(a) reduce(begin(a), end(a))
#define min_(a) reduce(begin(a), end(a), *begin(a), [](auto x, auto y) { return min(x, y); })
#define max_(a) reduce(begin(a), end(a), *begin(a), [](auto x, auto y) { return max(x, y); })
constexpr double degrees(double a) { return a * 180.0 / M_PI; }
constexpr double radians(double a) { return (a * M_PI) / 180.0; }

int main(int, [[maybe_unused]] char *argv[]) {
#ifdef DEBUG
  freopen(argv[1], "r", stdin);
#endif

  ios_base::sync_with_stdio(false);
  cin.tie(0);
  cout << fixed << setprecision(15);

  int N, M, K;
  cin >> N >> M >> K;
  vector<vector<int>> A(N, vector<int>(M, 0));
  rep(i, 0, N) {
    rep(j, 0, M) {
      cin >> A[i][j];
    }
  }

  vector<vector<int>> dp(N + 1, vector<int>(K + 1, 0));
  dp[0][0] = 1;
  rep(i, 0, N) {
    rep(j, 0, K + 1) {
      if (dp[i][j]) {
        for (auto x : A[i]) {
          if (j + x <= K) dp[i + 1][j + x] = 1;
        }
      }
    }
  }

  for (int i = K; i > -1; --i) {
    if (dp[N][i]) {
      cout << K - i << endl;
      return 0;
    }
  }
  cout << -1 << endl;
  return 0;
}