#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define endl '\n'
ll N = 1e9+7;
ll oo =1e13;
const ll maxx = 1000000 + 3;
ll n,m,k,q,x,y,z,l,r,mid,ans;
string s1,s2;
vector<vector<ll>>arr(15,vector<ll>(15,0));

ll go(ll ind ,vector<ll>v) {
    if (ind==n) {
        for (ll i=1;i<=m;i++) {
            if (v[i] < x)return oo;
        }
        return 0;
    }

    vector<ll>vch1=v;
    for (ll i=1;i<=m;i++){vch1[i]+=arr[ind][i];}

    ll ch1 = go(ind+1,vch1)+arr[ind][0];
    ll ch2 = go(ind+1,v);

    return min(ch1,ch2);
}
void solve() {
    cin>>n>>m>>x;
    for (ll i =0 ;i <n;i++) {
        for (ll j=0;j<=m;j++) {
            cin>>arr[i][j];
        }
    }
    vector<ll>v(m+1,0);
    ll o = go(0,v);
    if (o==oo)cout<<-1;
    else cout <<o;
}
int main() {
    ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0);
    ll t=1 ;
    // cin >>t;
    while (t--) {
        ans=0;
        solve();
    }
}