#include <bits/stdc++.h>
#define LLI long long int
#define FOR(v, a, b) for(LLI v = (a); v < (b); ++v)
#define FORE(v, a, b) for(LLI v = (a); v <= (b); ++v)
#define REP(v, n) FOR(v, 0, n)
#define REPE(v, n) FORE(v, 0, n)
#define REV(v, a, b) for(LLI v = (a); v >= (b); --v)
#define ALL(x) (x).begin(), (x).end()
#define RALL(x) (x).rbegin(), (x).rend()
#define ITR(it, c) for(auto it = (c).begin(); it != (c).end(); ++it)
#define RITR(it, c) for(auto it = (c).rbegin(); it != (c).rend(); ++it)
#define EXIST(c,x) ((c).find(x) != (c).end())
#define fst first
#define snd second
#define popcount __builtin_popcount
#define UNIQ(v) (v).erase(unique(ALL(v)), (v).end())
#define bit(i) (1LL<<(i))

#ifdef DEBUG
#include <misc/C++/Debug.cpp>
#else
#define dump(...) ((void)0)
#endif

#define gcd __gcd

using namespace std;
template <class T> constexpr T lcm(T m, T n){return m/gcd(m,n)*n;}

template <typename I> void join(ostream &ost, I s, I t, string d=" "){for(auto i=s; i!=t; ++i){if(i!=s)ost<<d; ost<<*i;}ost<<endl;}
template <typename T> istream& operator>>(istream &is, vector<T> &v){for(auto &a : v) is >> a; return is;}

template <typename T, typename U> bool chmin(T &a, const U &b){return (a>b ? a=b, true : false);}
template <typename T, typename U> bool chmax(T &a, const U &b){return (a<b ? a=b, true : false);}
template <typename T, size_t N, typename U> void fill_array(T (&a)[N], const U &v){fill((U*)a, (U*)(a+N), v);}

struct Init{
  Init(){
    cin.tie(0);
    ios::sync_with_stdio(false);
  }
}init;

int main(){
  int N,M,K;
  while(cin >> N >> M >> K){
    vector<vector<int>> a(N, vector<int>(M)); cin >> a;

    bool no = false;
    int ans = 0;

    //dump(a);

    vector<bool> dp(K+1);
    dp[0] = true;

    REP(i,N){
      dump(dp);

      vector<bool> temp(K+1);

      REP(j,M){
        REV(k,K,0){
          //dump(k+a[i][j]);
          if(k+a[i][j] <= K) temp[k+a[i][j]] = temp[k+a[i][j]] or dp[k];
        }
      }


      swap(temp, dp);
    }


    REPE(i,K){
      if(dp[i]){
        ans = i;
      }
    }

    if(ans == 0){
      no = true;
    }else{
      ans = K - ans;
    }

    if(no){
      cout << -1 << endl;
    }else{
      cout << ans << endl;
    }
  }

  return 0;
}