#include <iostream>
#include <vector>
#include <string>
#include <algorithm>
#include <cstring>
#include <cstdlib>
#include <cmath>
using namespace std;
using ll = long long;

int main() {
    int n, m, k;
    cin >> n >> m >> k;

    int p[11][501] = {};
    p[0][0] = 1;

    for (int i = 0; i < n; i++) {
        for (int j = 0; j < m; j++) {
            int a;
            cin >> a;

            for (int k = a; k <= 500; k++) {
                p[i + 1][k] |= p[i][k - a];
            }
        }
    }

    for (int k1 = k; k1 >= 0; k1--) {
        if (p[n][k1]) {
            cout << k - k1 << endl;
            exit(0);
        }
    }

    cout << -1 << endl;

    return 0;
}