#include <bits/stdc++.h>

using namespace std;
typedef long long ll;
typedef long int li;
typedef long double lb;
#define rep(i,j,n) for (ll i = j; i < (n); i++)
#define repr(i,j,n) for(ll i = j; i >= (n); i--)
#define all(x) (x).begin(),(x).end()
#define CLR(mat,f) memset(mat, f, sizeof(mat))
#define IN(a, b, x) (a<=x&&x<b)
#define out(ans) cout << ans << endl
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }
typedef pair<ll,ll>P;
const ll mod=1e9+7;
const int INF = 1000000;
const double PI=3.14159265359;

int main(){

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

  ll minCosts=0;
  rep(i,0,n)minCosts+=a[i][0];
  if(minCosts>k){
    out(-1);
    return 0;
  }
  const int N=510;
  bool dp[n+1][N];
  rep(i,0,n+1)CLR(dp[i],false);
  dp[0][0]=true;
  rep(i,0,n){
    vector<ll>v;
    rep(j,0,m){
      repr(c,N+1,a[i][j])if(dp[i][c-a[i][j]])v.push_back(c);
    }
    for(auto y:v)dp[i+1][y]=true;
  }

  repr(j,k,0){
    if(dp[n][j]){
      out(k-j);
      return 0;
    }
  }
  return 0;
}