// #define _GLIBCXX_DEBUG // for STL debug (optional)
#include <iostream>
#include <iomanip>
#include <cstdio>
#include <string>
#include <cstring>
#include <deque>
#include <list>
#include <queue>
#include <stack>
#include <vector>
#include <utility>
#include <algorithm>
#include <map>
#include <set>
#include <complex>
#include <cmath>
#include <limits>
#include <cfloat>
#include <climits>
#include <ctime>
#include <cassert>
#include <numeric>
#include <fstream>
#include <functional>
#include <bitset>
using namespace std;
using ll = long long int;
using int64 = long long int;
 
template<typename T> void chmax(T &a, T b) {a = max(a, b);}
template<typename T> void chmin(T &a, T b) {a = min(a, b);}
template<typename T> void chadd(T &a, T b) {a = a + b;}
 
int dx[] = {0, 0, 1, -1};
int dy[] = {1, -1, 0, 0};
const int INF = 1LL << 29;
const ll LONGINF = 1LL << 60;
const ll MOD = 1000000007LL;

int dp[15][510];
int main() {
    int N, M, K; cin >> N >> M >> K;
    vector< vector<int> > A(N, vector<int>(M));
    for(int i=0; i<N; i++) {
        for(int j=0; j<M; j++) {
            cin >> A[i][j];
        }
    }

    dp[0][0] = true;
    for(int i=0; i<N; i++) {
        for(int j=0; j<=K; j++) {
            for(int k=0; k<M; k++) {
                if(j - A[i][k] < 0) continue;
                dp[i+1][j] |= dp[i][j - A[i][k]];
            }
        }
    }

    for(int i=K; i>=0; i--) {
        if(dp[N][i]) {
            cout << K - i << endl;
            return 0;
        }
    }
    cout << -1 << endl;
    return 0;
}