#include <iostream>
#include <algorithm>
#include <string>
#include <vector>
#include <cmath>
#include <map>
#include <queue>
#include <iomanip>
#include <set>
#include <tuple>
#define mkp make_pair
#define mkt make_tuple
#define rep(i,n) for(int i = 0; i < (n); ++i)
using namespace std;
typedef long long ll;
const ll MOD=1e9+7;

int dp[11][505];

int main(){
  int N,M,K;
  cin>>N>>M>>K;
  vector<vector<int>> A(N);
  rep(i,N){
    A[i].resize(M);
    rep(j,M) cin>>A[i][j];
  }

  dp[0][0]=1;
  for(int i=0;i<N;i++){
    for(int j=0;j<=K;j++){
      if(dp[i][j]==0) continue;
      for(int k=0;k<M;k++){
        if(j+A[i][k]<=K) dp[i+1][j+A[i][k]]=1;
      }
    }
  }

  int ans=-1;
  for(int j=0;j<=K;j++){
    if(dp[N][j]) ans=K-j;
  }
  cout<<ans<<endl;

  return 0;
}