// I SELL YOU...! 
#include<iostream>
#include<vector>
#include<algorithm>
#include<functional>
#include<queue>
#include<chrono>
#include<iomanip>
#include<map>
#include<set>
using namespace std;
using ll = long long;
using P = pair<ll,ll>;
using TP = tuple<ll,ll,ll>;
void init_io(){
  cin.tie(0);
  ios::sync_with_stdio(false);
  cout << fixed << setprecision(18);
}
signed main(){
  init_io();
  ll n,m,k;
  cin >> n >> m >> k;
  vector<vector<ll>> a(n,vector<ll>(m));
  vector<vector<bool>> dp(n+1,vector<bool>(k+1,false));
  for(int i=0;i<n;i++){
    for(int j=0;j<m;j++){
      cin >> a[i][j];
    }
  }
  dp[0][0] = true;
  for(int i=0;i<n;i++){
    for(int j=0;j<m;j++){
      for(int x=a[i][j];x<=k;x++){
        dp[i+1][x] = dp[i+1][x]|dp[i][x-a[i][j]];
      }
    }
  }
  ll ans = k+1;
  for(int i=0;i<=k;i++){
    if(dp[n][i]){
      ans = i;
    }
  }
  cout << k-ans << endl;
}