#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
#define rep(i, n) for (ll i = 0; i < n; i++)
#define FOR(i, a, b) for (ll i = a; i < b; i++)
#define len(v) ll(v.size())
#define fi first
#define se second

template <class T>
void cout_vec(const vector<T> &vec){
  for(auto itr:vec) cout<<itr<<' ';
  cout<<endl;
}

template <class T>
void cout_vec2(const vector<vector<T>> &vec){
  rep(i,vec.size()){
    rep(j,vec[i].size()){
      cout<<vec[i][j]<<' ';
    }
    cout<<endl;
  }
}

typedef pair<ll,ll> P;
const ll mod=1e9+7;
const ll inf=1e15;

int main(){
  cin.tie(0);
  ios::sync_with_stdio(false);
  int n,m,k;
  cin>>n>>m>>k;
  vector<vector<int>> a(n+1,vector<int>(m+1));
  rep(i,n)rep(j,m) cin>>a[i+1][j+1];
  vector<vector<bool>> dp(n+1,vector<bool>(k+10,false));
  dp[0][k]=true;
  rep(i,n)rep(j,k+1){
    FOR(l,1,m+1){
      if(j+a[i+1][l]<=k) dp[i+1][j]=dp[i+1][j]||dp[i][j+a[i+1][l]];
    }
  }
  FOR(i,1,n+1){
    bool flag=false;
    rep(j,k+1){
      if(dp[i][j]){
        flag=true;
        break;
      }
    }
    if(!flag){
      cout<<-1<<endl;
      return 0;
    }
    if(i==n){
      int ans;
      rep(j,k+1){
        if(dp[i][j]){
          ans=j;
          break;
        }
      }
      cout<<ans<<endl;
    }
  }
}