#include<iostream>
#include<string>
#include<vector>
#include<algorithm>
#include<map>
#include<set>
#include<cstdio>
#include<cmath>
#include<numeric>
#include<queue>
#include<stack>
#include<cstring>
#include<limits>
#include<functional>
#include<unordered_set>
#include<iomanip>
#include<cassert>
#define rep(i,a) for(int i=(int)0;i<(int)a;++i)
#define pb push_back
#define eb emplace_back
using ll=long long;
constexpr ll mod = 1e9 + 7;
constexpr ll INF = 1LL << 50;
 
template<class T> inline bool chmin(T& a, T b) {
    if (a > b) {
        a = b;
        return true;
    }
    return false;
}
template<class T> inline bool chmax(T& a, T b) {
    if (a < b) {
        a = b;
        return true;
    }
    return false;
}
using namespace std;
 
void solve(){
    int n,m,k;
    cin>>n>>m>>k;
    vector<vector<int>>A(n,vector<int>(m));
    int ans=0,sum=0;
    rep(i,n){
        int minv=1000;
        rep(j,m){
            cin>>A[i][j];
            minv=min(minv,A[i][j]);
        }
        sum+=minv;
    }
    if(sum>k){
        cout<<-1<<"\n";
        return;
    }
    rep(i,m){
        int sum2=0;
        rep(j,n){
            sum2+=A[j][i];
        }
            if(sum2>k){
                for(int bit=0;bit<(1<<n);++bit){
                    int sum3=sum2;
                    for(int h=0;h<n;++h){
                        if(bit&1<<h){
                            sum3-=A[h][i];
                            sum3+=A[h][i-1];
                        }
                    }
                    if(sum3<=k)ans=max(ans,sum3);
                }
            }
    }
    cout<<k-ans<<"\n";
}
 
 
signed main(){
	ios::sync_with_stdio(false);
        cin.tie(0);
	cout<<fixed<<setprecision(15);
	solve();
	return 0;
}