#include <bits/stdc++.h>
#include "atcoder/all"
#define debug cout << "OK" << endl;
template<typename T>
inline bool chmax(T& a, const T b) { if (a < b) { a = b; return true; } return false; }
template<typename T>
inline bool chmin(T& a, const T b) { if (a > b) { a = b; return true; } return false; }
inline int Code(char c) {
	if ('A' <= c and c <= 'Z')return (int)(c - 'A');
	if ('a' <= c and c <= 'z')return (int)(c - 'a');
	if ('0' <= c and c <= '9')return (int)(c - '0');
	assert(false);
}
using namespace std;
using namespace atcoder;
#define int long long
constexpr int MOD = 998244353;
constexpr int INF = (1LL << 63);
using minit = modint998244353;

template<typename T>
ostream& operator << (ostream& st, const vector<T>& v) {
	for (const T value : v) {
		st << value << " ";
	}
	return st;
}
template<typename T>
istream& operator >> (istream& st, vector<T>& v) {
	for (T& value : v) {
		st >> value;
	}
	return st;
}

//

//

class Solver {
public:
	int T;
	Solver() :T(1) {}
	~Solver(){}
	void multi();
	void solve() const;
};
void Solver::multi() {
	cin >> T;
	return;
}
void Solver::solve() const {
	int N, M, K;
	cin >> N >> M >> K;
	vector<vector<bool>> DP(N + 1, vector<bool>(553, false));
	DP[0][0] = true;
	for (int i = 0; i < N; i++) {
		for (int j = 0; j < M; j++) {
			int a;
			cin >> a;
			for (int k = 0; k < 503; k++) {
				if (DP[i][k])
					DP[i + 1][k + a] = true;
			}
		}
	}
	for (int i = K; i >= 0; i--)
		if (DP[N][i]) {
			cout << K - i << endl;
			return;
		}
	cout << -1 << endl;
	return;
}

signed main() {
	Solver solver;
	for (int i = 0; i < solver.T; i++)
		solver.solve();
	return 0;
}

/*
* わらびのコードこーどすぺーす
 (σ･∀･)σｹﾞｯﾂ!!
*/