#include <bits/stdc++.h>
using namespace std;

#define int long long
#define rep(i,l,r) for(int i=(int)(l);i<(int)(r);i++)
#define all(x) (x).begin(),(x).end()
#define sz(x) ((int)x.size())
template<class T>bool chmax(T &a,T b){if(a<b){a=b;return 1;}return 0;}
template<class T>bool chmin(T &a,T b){if(a>b){a=b;return 1;}return 0;}

typedef pair<int, int> pii;
typedef vector<int> vi;
typedef vector<vi> vvi;

const int inf = 1LL<<60;
const int mod = 1e9 + 7;
const double eps = 1e-9;

/*{
  }*/

int n, m, k;
int a[10][10];

int dfs(int k, int i, int x){
  if(i == x) return k;
  int res = inf;
  rep(j, 0, m){
    if(k-a[i][j] >= 0) chmin(res, dfs(k-a[i][j], i+1, x));
  }
  return res;
}

signed main(){
  cin >> n >> m >> k;
  rep(i, 0, n) rep(j, 0, m) cin >> a[i][j];

  int ans;
  if(n <= 5){
    ans = dfs(k, 0, n);
  }else{
    ans = inf;
    rep(i, 0, k+1){
      int j = k-i;
      int x = dfs(i, 0, 5);
      int y = dfs(j, 5, n);
      chmin(ans, x+y);
    }
  }

  if(ans >= inf) cout << -1 << endl;
  else cout << ans << endl;

  return 0;
}