// Slower C++ solution:
#include<iostream>

#include<string>

#include<cstdio>

#include<vector>

#include<cmath>

#include<algorithm>

#include<functional>

#include<iomanip>

#include<queue>

#include<ciso646>

#include<random>

#include<map>

#include<set>

#include<bitset>

#include<stack>

#include<unordered_map>

#include<utility>

#include<cassert>

#include<complex>

#include<numeric>

using namespace std;



//#define int long long

typedef long long ll;



typedef unsigned long long ul;

typedef unsigned int ui;

constexpr ll mod = 998244353;

const ll INF = mod * mod;

typedef pair<int, int>P;

#define stop char nyaa;cin>>nyaa;

#define rep(i,n) for(int i=0;i<n;i++)

#define per(i,n) for(int i=n-1;i>=0;i--)

#define Rep(i,sta,n) for(int i=sta;i<n;i++)

#define rep1(i,n) for(int i=1;i<=n;i++)

#define per1(i,n) for(int i=n;i>=1;i--)

#define Rep1(i,sta,n) for(int i=sta;i<=n;i++)

#define all(v) (v).begin(),(v).end()

typedef pair<ll, ll> LP;

typedef long double ld;

typedef pair<ld, ld> LDP;

const ld eps = 1e-12;

const ld pi = acos(-1.0);





struct modint {

	ll n;

	modint() :n(0) { ; }

	modint(ll m) :n(m) {

		if (n >= mod)n %= mod;

		else if (n < 0)n = (n%mod + mod) % mod;

	}

	operator int() { return n; }

};

bool operator==(modint a, modint b) { return a.n == b.n; }

modint operator+=(modint &a, modint b) { a.n += b.n; if (a.n >= mod)a.n -= mod; return a; }

modint operator-=(modint &a, modint b) { a.n -= b.n; if (a.n < 0)a.n += mod; return a; }

modint operator*=(modint &a, modint b) { a.n = ((ll)a.n*b.n) % mod; return a; }

modint operator+(modint a, modint b) { return a += b; }

modint operator-(modint a, modint b) { return a -= b; }

modint operator*(modint a, modint b) { return a *= b; }

modint operator^(modint a, int n) {

	if (n == 0)return modint(1);

	modint res = (a*a) ^ (n / 2);

	if (n % 2)res = res * a;

	return res;

}



ll inv(ll a, ll p) {

	return (a == 1 ? 1 : (1 - p * inv(p%a, a)) / a + p);

}

modint operator/(modint a, modint b) { return a * modint(inv(b, mod)); }



const int max_n = 1 << 19;

modint fact[max_n], factinv[max_n];

void init_f() {

	fact[0] = modint(1);

	for (int i = 0; i < max_n - 1; i++) {

		fact[i + 1] = fact[i] * modint(i + 1);

	}

	factinv[max_n - 1] = modint(1) / fact[max_n - 1];

	for (int i = max_n - 2; i >= 0; i--) {

		factinv[i] = factinv[i + 1] * modint(i + 1);

	}

}

modint comb(int a, int b) {

	if (a < 0 || b < 0 || a < b)return 0;

	return fact[a] * factinv[b] * factinv[a - b];

}





void solve() {

	int n, m; cin >> n >> m;

	vector<vector<int>> a(n, vector<int>(m));

	vector<int> c(n);

	int x; cin >> x;

	rep(i, n) {

		cin >> c[i];

		rep(j, m)cin >> a[i][j];

	}

	int ans = mod;

	rep(i, (1 << n)) {

		int cost = 0;

		rep(j, n)if (i&(1 << j))cost += c[j];

		vector<int> s(m);

		rep(j, n)rep(k, m) {

			if (i&(1 << j)) {

				s[k] += a[j][k];

			}

		}

		bool valid = true;

		rep(k, m)if (s[k] < x)valid = false;

		if (valid) {

			ans = min(ans, cost);

		}

	}

	if (ans == mod)ans = -1;

	cout << ans << "\n";

}





signed main() {

	ios::sync_with_stdio(false);

	cin.tie(0);

	//cout << fixed << setprecision(7);

	//init_f();

	//init();

	//int t; cin >> t;rep(i,t)

	solve();

	stop

		return 0;

}


// Faster C++ solution for the same problem (measured speedup: 46.37238920197321x):
#include <cstdio>

#include <algorithm>

using namespace std;

int n,m,x;

int c[15],a[15][15],b[15],d[15],len,sum=100000000,cost;

void dfs(int step){

	int i,j,k;

	if(step==len+1){

		for(k=1;k<=m;k++)d[k]=0;

		for(j=1;j<=len;j++)

			for(k=1;k<=m;k++)

				d[k]+=a[b[j]][k];

		for(k=1;k<=m;k++)

			if(d[k]<x)return;

		cost=0;

		for(j=1;j<=len;j++)cost+=c[b[j]];

		sum=min(sum,cost);

		return ;

	}

	for(i=b[step-1]+1;i<=n;i++)

		b[step]=i,dfs(step+1);

}

int main(){

	int i,j;

	scanf("%d%d%d",&n,&m,&x);

	for(i=1;i<=n;i++)

	{

		scanf("%d",&c[i]);

		for(j=1;j<=m;j++)

			scanf("%d",&a[i][j]);

	}

	for(len=1;len<=n;len++)

		b[0]=0,dfs(1);

	if(sum==100000000)printf("-1\n");

	else printf("%d\n",sum);

	return 0;

}