#include <iostream>
#define rep(i, n) for(i = 0; i < n; i++)
using namespace std;

int n, m, K;
int a[10][10];
bool dp[11][501];

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