/**
 * code generated by JHelper
 * More info: https://github.com/AlexeyDmitriev/JHelper
 * @author
 */

#include <iostream>
#include <fstream>

#ifndef SOLUTION_COMMON_H

#include <bits/stdc++.h>

using namespace std;

using ll = long long;
using PI = pair<int, int>;
template<class T> using V = vector<T>;
using VI = V<int>;
#define _1 first
#define _2 second

#ifdef MY_DEBUG
# define DEBUG(x) x
#else
# define DEBUG(x)
#endif

template<class T>
inline void debug(T &A) {
  DEBUG(
      for (const auto &a : A) {
        cerr << a << " ";
      }
      cerr << '\n';
  )
}

template<class T, class Func>
inline void debug_with_format(T &A, Func f) {
  DEBUG(
      for (const auto &a : A) {
        cerr << f(a) << " ";
      }
      cerr << '\n';
  )
}

template<class T>
inline void debug_dim2(T &A) {
  DEBUG(
      for (const auto &as : A) {
        debug(as);
      }
  )
}

template<typename ... Args>
inline void debug(const char *format, Args const &... args) {
  DEBUG(
      fprintf(stderr, format, args ...);
      cerr << '\n';
  )
}

template<typename ... Args>
string format(const string &fmt, Args ... args) {
  size_t len = snprintf(nullptr, 0, fmt.c_str(), args ...);
  vector<char> buf(len + 1);
  snprintf(&buf[0], len + 1, fmt.c_str(), args ...);
  return string(&buf[0], &buf[0] + len);
}

template<class T1, class T2>
string fmtP(pair<T1, T2> a) {
  stringstream ss;
  ss << "(" << a._1 << "," << a._2 << ")";
  return ss.str();
}

#define SOLUTION_COMMON_H

#endif //SOLUTION_COMMON_H

const int MOD = 1000000007;

class A {
public:
  void solve(std::istream& in, std::ostream& out) {
    int n, m, K;
    in >> n >> m >> K;
    int inf = K + 1;
    V<bool> best(K + 2, false), cur(K + 2, false), next(K + 2, false);
    best[0] = true;
    for (int i = 0; i < n; ++i) {
      fill(next.begin(), next.end(), false);
      for (int j = 0; j < m; ++j) {
        fill(cur.begin(), cur.end(), false);
        int a;
        in >> a;
        for (int k = 0; k <= K; ++k) {
          if (best[k]) cur[min(k + a, inf)] = true;
        }

        for (int k = 0; k <= K; ++k) {
          if (cur[k]) next[k] = true;
        }
      }
      debug(next);
      swap(best, next);
    }
    int mx = inf;
    for (int i = K; i >= 0; --i) {
      if (best[i]) mx = i;
    }
    if (mx == inf) out << -1;
    else out << K - mx;
  }
};


int main() {
	A solver;
	std::istream& in(std::cin);
	std::ostream& out(std::cout);
	solver.solve(in, out);
	return 0;
}