#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i = 0; i < (n);i++)
#define sz(x) int(x.size())
typedef long long ll;
typedef pair<int,int> P;

const int INF = 1e9;

int main(){
  int n, m, k;
  cin >> n >> m >> k;
  vector<vector<int>> a(n,vector<int>(m));

  rep(i,n) rep(j,m) cin >> a[i][j];

  vector<int> dp(k+1,0);
  dp[0] = 1;
  rep(i,n) {
    vector<int> dp2(k+1,0);
    rep(j,m) {
      for (int c = 0; c + a[i][j] <= k; c++) {
        if (dp[c]) dp2[c+a[i][j]] = dp[c];
      }   
    }
    dp = dp2;
  }
  for (int i = k; i >= 0; i--) {
    if (dp[i]) {
      cout << k - i << endl;
      return 0;
    }
  }
  cout << -1 << endl;
  return 0;
}