#include <bits/stdc++.h>
 
using namespace std;
 
#define lli long long int
#define REP(i,s,n) for(int i=s;i<n;i++)
#define MOD 1000000007
#define NUM 2520
#define INF (1LL<<50)
#define DEBUG 0
#define mp(a,b) make_pair(a,b)
#define SORT(V) sort(V.begin(),V.end())

signed main(){
 
	lli n,m,k;
	cin>>n>>m>>k;

	lli data[12][12];

	REP(i,0,n)REP(j,0,m)cin>>data[i][j];

	unordered_set<lli> s;

	REP(i,0,m)s.insert(data[0][i]);

	REP(i,1,n){
		unordered_set<lli> next;
		for(auto e:s){
			REP(j,0,m){
				if(data[i][j]<=k){
					if(DEBUG)cout<<"nextPush ="<<e+data[i][j]<<endl;
					next.insert(e+data[i][j]);
				}
			}
		}
		s.clear();
		for(auto e:next){
			s.insert(e);
		}
	}

	lli ans = INF;
	for(auto e:s){
		if(k-e<0)continue;
		ans = min(ans,k-e);
	}
	if(ans == INF)cout<<-1<<endl;
	else cout<<ans<<endl;

	return 0;
}