#include <bits/stdc++.h> typedef long long ll; typedef long double ld; const int INF=1e9,MOD=1e9+7,ohara=1e6+10; const ll LINF=1e18; using namespace std; #define rep(i,n) for(ll (i)=0;(i)<(int)(n);(i)++) #define rrep(i,a,b) for(ll i=(a);i<(b);i++) #define rrrep(i,a,b) for(ll i=(a);i>=(b);i--) #define all(v) (v).begin(), (v).end() #define Size(n) (n).size() #define Cout(x) cout<<(x)<<endl #define doublecout(a) cout<<fixed<<setprecision(15)<<a<<endl; #define Cerr(x) cerr<<(x)<<endl #define fi first #define se second #define P pair<ll,ll> #define m_p make_pair #define V vector<ll> #define U_MAP unordered_map<ll,ll> #define pq priority_queue<ll> #define rpq priority_queue<ll,vector<ll>,greater<ll>> #define p_b push_back ll n,cnt,ans,a[2000][2000],b,c,d,tmp,tmpp,m,h,w,x,y,sum,pos,k,q; ld doua; int dy[]={1,0,-1,0}; int dx[]={0,1,0,-1}; //int dy[]={-1,0,1,-1,1,-1,0,1}; //int dx[]={-1,-1,-1,0,0,1,1,1}; string alph("abcdefghijklmnopqrstuvwxyz"),s; bool fl; struct edge{int to,cost;}; ll dp[20][100000]; //------ Believe yourself as a genius!!!!!! ------ int main(void){ cin.tie(0); cout.tie(0); ios::sync_with_stdio(false); cin>>n>>m>>k; rep(i,n)rep(j,m)cin>>a[i][j]; dp[0][0]=1; rrep(i,1,n+1){ ll mi=LINF; rep(j,m){ mi=min(mi,a[i-1][j]); rep(z,1000){ if(z<a[i-1][j])continue; if(dp[i-1][z-a[i-1][j]]==1)dp[i][z]=1; } } cnt+=mi; } if(cnt>k){ Cout(-1); return 0; } rrrep(i,k,0){ if(dp[n][i]==1){ ans=i; break; } } Cout(k-ans); return 0; }