#include <bits/stdc++.h>
using namespace std;

int main() {
	int n, m, K; cin >> n >> m >> K;
	int a[n][m];
	for(int i = 0; i < n; ++i)
		for(int j = 0; j < m; ++j)
			cin >> a[i][j];
	bool dp[n + 1][K + 1] = {};
	dp[0][0] = true;
	for(int i = 1; i <= n; ++i) {
		for(int j = 0; j <= K; ++j) {
			for(int k = 0; k < m; ++k) {
				if(j - a[i - 1][k] >= 0) {
					dp[i][j] |= dp[i - 1][j - a[i - 1][k]];
				}
			}
		}
	}
	int ans = -1;
	for(int i = 0; i <= K; ++i) {
		if(dp[n][i]) ans = K - i;
	}
	cout << ans << endl;
	return 0;
}