#pragma GCC optimize ("O3")
#pragma GCC target ("avx")
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for(int i = 0; i < (n); i++)
#define rep1(i, n) for(int i = 1; i <= (n); i++)
#define co(x) cout << (x) << "\n"
#define cosp(x) cout << (x) << " "
#define ce(x) cerr << (x) << "\n"
#define cesp(x) cerr << (x) << " "
#define pb push_back
#define mp make_pair
#define chmin(x, y) x = min(x, y)
#define chmax(x, y) x = max(x, y)
#define Would
#define you
#define please

int main() {
	cin.tie(0);
	ios::sync_with_stdio(false);


	int N, M, K;
	cin >> N >> M >> K;
	int A[10][10];
	rep(i, N) rep(j, M) {
		cin >> A[i][j];
	}

	bool dp[11][501] = {};
	dp[0][0] = 1;
	rep(i, N) {
		rep(j, K + 1) {
			rep(k, M) {
				if (j + A[i][k] <= K) dp[i + 1][j + A[i][k]] |= dp[i][j];
			}
		}
	}

	int kotae = -1;
	rep(i, K + 1) {
		if (dp[N][i]) kotae = i;
	}

	if (kotae == -1) co(-1);
	else co(K - kotae);

	Would you please return 0;
}