#include <bits/stdc++.h>
#define rep(i,n) for(int i = 0; i < (n); ++i)
#define srep(i,s,t) for (int i = s; i < t; ++i)
#define drep(i,n) for(int i = (n)-1; i >= 0; --i)
using namespace std;
typedef long long int ll;
typedef pair<int,int> P;
#define yn {puts("Yes");}else{puts("No");}
#define MAX_N 200005

int main() {
    int n, m, k;
    cin >> n >> m >> k;
    int a[n][m];
    rep(i,n){
        rep(j,m){
            cin >> a[i][j];
        }
    }

    int dp[n][501];
    rep(i,n){
        rep(j,501){
            dp[i][j] = 0;
        }
    }

    rep(i, n){
        rep(j,m){
            rep(l, 501){
                if(i == 0){
                    if(l == a[i][j]){
                        dp[i][l] = 1;
                    }
                }else{
                    if(a[i][j] <= l && dp[i-1][l-a[i][j]] == 1){
                        dp[i][l] = 1;
                    }
                }
            }
        }
    }

    drep(i,k+1){
        if(dp[n-1][i] == 1){
            cout << k - i << endl;
            return 0;
        }
    }
    cout << "-1" << endl;
    return 0;
}