#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define P pair<ll,ll>
#define FOR(I,A,B) for(ll I = ll(A); I < ll(B); ++I)
#define FORR(I,A,B) for(ll I = ll((B)-1); I >= ll(A); --I)
#define TO(x,t,f) ((x)?(t):(f))
#define SORT(x) (sort(x.begin(),x.end())) // 0 2 2 3 4 5 8 9
#define POSL(x,v) (lower_bound(x.begin(),x.end(),v)-x.begin()) //xi>=v  x is sorted
#define POSU(x,v) (upper_bound(x.begin(),x.end(),v)-x.begin()) //xi>v  x is sorted
#define NUM(x,v) (POSU(x,v)-POSL(x,v))  //x is sorted
#define REV(x) (reverse(x.begin(),x.end())) //reverse
ll gcd(ll a,ll b){if(a%b==0)return b;return gcd(b,a%b);}
ll lcm(ll a,ll b){ll c=gcd(a,b);return ((a/c)*(b/c)*c);}
#define NEXTP(x) next_permutation(x.begin(),x.end())
const ll INF=ll(1e18)+ll(7);
const ll MOD=1000000007LL;
#define out(a) cout<<fixed<<setprecision((a))
mt19937_64 mt(1);//seed
uniform_real_distribution<double> rnd(0.00,1.00);

int N,M,ans=MOD,sum=0,K,anst=0;
vector< vector<int> > A;
void dfs(int k=0){
	if(k==N)return;
	FOR(i,0,M){
		anst += A[k][i];
		if(k==N-1)if(K-anst>=0)ans = min(ans,K-anst);
		dfs(k+1);
		anst -= A[k][i];
	}
}

int main(){
	cin >> N >> M >> K;
	vector<int> x(M);
	A.resize(N,x);
	FOR(i,0,N)FOR(j,0,M)cin >> A[i][j];
	dfs(0);
	if(ans==MOD)ans = -1;
	cout << ans << endl;
}