#include<bits/stdc++.h>
using namespace std;
#define REP(i,m,n) for(int i=(m);i<(n);i++)
#define rep(i,n) REP(i,0,n)
#define pb push_back
#define mp make_pair
#define all(c) (c).begin(),(c).end()
#define rall(c) (c).rbegin(),(c).rend()
typedef long long ll;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
const ll inf=1e9+7;
const ll mod=998244353;
int main(){
    ll n,m,k;cin>>n>>m>>k;
    vector<vector<ll> >a(n+1,vector<ll>(m));
    rep(i,n)rep(j,m)cin>>a[i+1][j];
    ll mi=k;
    vector<vector<ll> >dp(n+1,vector<ll>(k+1));
    dp[0][k]=1;
    REP(i,1,n+1){
        rep(j,k+1){
            rep(s,m){
                if(j+a[i][s]<=k){
                    dp[i][j]=max(dp[i][j],dp[i-1][j+a[i][s]]);
                }
                dp[i][j]=max(dp[i][j],dp[i-1][j]);
            }
        }
    }
    rep(i,k+1){
        if(dp[n][i]){
            mi=i;
            break;
        }
    }
    cout<<mi<<endl;
}