#include <bits/stdc++.h>
using namespace std;
 
template<typename T> istream &operator>>(istream &is, vector<T> &vec){ for (auto &v : vec) is >> v; return is; }
template<typename T> ostream &operator<<(ostream &os, const vector<T> &vec){ os << "["; for (auto v : vec) os << v << ", "; os << "]"; return os; }
template<typename T> ostream &operator<<(ostream &os, const deque<T> &vec){ os << "deq["; for (auto v : vec) os << v << ", "; os << "]"; return os; }
template<typename T> ostream &operator<<(ostream &os, const set<T> &vec){ os << "{"; for (auto v : vec) os << v << ", "; os << "}"; return os; }
template<typename T> ostream &operator<<(ostream &os, const unordered_set<T> &vec){ os << "{"; for (auto v : vec) os << v << ", "; os << "}"; return os; }
template<typename T> ostream &operator<<(ostream &os, const multiset<T> &vec){ os << "{"; for (auto v : vec) os << v << ", "; os << "}"; return os; }
template<typename T> ostream &operator<<(ostream &os, const unordered_multiset<T> &vec){ os << "{"; for (auto v : vec) os << v << ", "; os << "}"; return os; }
template<typename T1, typename T2> ostream &operator<<(ostream &os, const pair<T1, T2> &pa){ os << "(" << pa.first << ", " << pa.second << ")"; return os; }
template<typename TK, typename TV> ostream &operator<<(ostream &os, const map<TK, TV> &mp){ os << "{"; for (auto v : mp) os << v.first << ": " << v.second << ", "; os << "}"; return os; }
template<typename TK, typename TV> ostream &operator<<(ostream &os, const unordered_map<TK, TV> &mp){ os << "{"; for (auto v : mp) os << v.first << ": " << v.second << ", "; os << "}"; return os; }
template<typename T> void ndarray(vector<T> &vec, int len) { vec.resize(len); }
template<typename T, typename... Args> void ndarray(vector<T> &vec, int len, Args... args) { vec.resize(len); for (auto &v : vec) ndarray(v, args...); }
template<typename T> bool chmax(T &m, const T q) { if (m < q) {m = q; return true;} else return false; }
template<typename T> bool chmin(T &m, const T q) { if (q < m) {m = q; return true;} else return false; }
template<typename T1, typename T2> pair<T1, T2> operator+(const pair<T1, T2> &l, const pair<T1, T2> &r) { return make_pair(l.first + r.first, l.second + r.second); }
template<typename T1, typename T2> pair<T1, T2> operator-(const pair<T1, T2> &l, const pair<T1, T2> &r) { return make_pair(l.first - r.first, l.second - r.second); }
#define f first
#define s second
vector<vector<int>> arr;
int books, algos, target;
long long dp(vector<int> skills, long long cost, int book) {
    if(book == books) {
        bool ok = true;
        for(int i = 0; i < algos; i++) {
            if(skills[i] < target) {
                ok = false;
                break;
            }
        }
        if(ok)
            return cost;
        return 1e18;
    }
    long long a = dp(skills, cost, book + 1);
    for(int i = 1; i <= algos; i++) {
        skills[i - 1] += arr[book][i];
    }
    cost += arr[book][0];
    long long b = dp(skills, cost, book + 1);
    long long c = 1e18;
    bool ok = true;
    for(int i = 0; i < algos; i++) {
        if(skills[i] < target) {
            ok = false;
            break;
        }
    }
    if(ok)
        c = cost;
    return min({a, b, c});
}


int main() {
    ios::sync_with_stdio(0);
    cin.tie(0);
    cin >> books >> algos >> target;
    arr.resize(books, vector<int> (algos + 1));
    for(int i = 0; i < books; i++)
        for(int j = 0; j <= algos; j++)
            cin >> arr[i][j];
    vector<int> skills(algos, 0);
    long long ans = dp(skills, 0, 0);
    if(ans == 1e18)
        cout << -1;
    else
        cout << ans;
}



Measured memory_bytes: 3616