#include <iostream>
#include <algorithm>
#include <vector>
#include <queue>
#include <iomanip>
#include <cmath>
#include <map>
using namespace std;
#define REP(i,n) for (int i=0;i<(n);++i)
using ll = long long;
constexpr ll INF = 1LL << 60;
constexpr int MOD = 998244353;

ll N, M, K, A[11][11], dp[11][505];

ll dfs(int n, int k) {
  if(k < 0) return INF;
  if(n == N) return k;
  if(~dp[n][k]) return dp[n][k];

  ll ret = INF;
  for(int i = 0; i < M; ++i) {
    ret = min(ret, dfs(n+1, k - A[n][i]));
  }
  return dp[n][k] = ret;
}

int main() {
  cin.tie(0); ios_base::sync_with_stdio(false);
  cin >> N >> M >> K;
  REP(i, N) REP(j, M) cin >> A[i][j];
  REP(i, 11) REP(j, 505) dp[i][j] = -1;
  ll ans = dfs(0, K);
  if(ans == INF) cout << -1;
  else cout << dfs(0, K);
  cout << '\n';
  return 0;
}