/** 	Author: Apoorva Mittal  **/
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define endl "\n"
#define vi vector<int>
#define vvi vector<vector<int>>
#define vii vector<pair<int, int>>
#define rep(i, a, b) for (int i = a; i < b; i++)
#define repD(i, a, b) for (int i = a; i >= b; i--)
#define speed                   \
  ios_base::sync_with_stdio(0); \
  cin.tie(0);                   \
  cout.tie(0)
#define init(i, k) memset(i, k, sizeof i)
#define pb push_back
#define pii pair<int, int>
#define ff first
#define ss second
#define all(a) a.begin(), a.end()
#define inp(a) rep(i, 0, a.size()) cin >> a[i];
//--------------------------------------------debugging showoff---------------------------------------------------------
#define out(a)                             \
  cout << #a << ": " << endl;              \
  rep(i, 0, a.size()) cout << a[i] << " "; \
  cout << endl;
#define out2d(a)              \
  cout << #a << ": " << endl; \
  rep(i, 0, a.size())         \
  {                           \
    rep(j, 0, a[0].size())    \
            cout              \
        << a[i][j] << " ";    \
    cout << endl;             \
  }
#define sim template <class c
#define ris return *this
#define dor > deb &operator<<
#define eni(x)                                                                \
  sim > typename enable_if<sizeof dud<c>(0) x 1, deb &>::type operator<<(c i) \
  {
sim > struct rge
{
  c b, e;
};
sim > rge<c> range(c i, c j) { return rge<c>{i, j}; }
sim > auto dud(c *x) -> decltype(cerr << *x, 0);
sim > char dud(...);
struct deb
{
#ifdef LOCAL
  ~deb()
  {
    cerr << endl;
  }
  eni(!=) cerr << boolalpha << i;
  ris;
} eni(==) ris << range(begin(i), end(i));
}
sim, class b dor(pair<b, c> d)
{
  ris << "(" << d.first << ", " << d.second << ")";
}
sim dor(rge<c> d)
{
  *this << "[";
  for (auto it = d.b; it != d.e; ++it)
    *this << ", " + 2 * (it == d.b) << *it;
  ris << "]";
}
#else
  sim dor(const c &)
  {
    ris;
  }
#endif
}
;
#define show(...) " [" << #__VA_ARGS__ ": " << (__VA_ARGS__) << "] "
// -DLOCAL
//--------------------------------------------useless stuff---------------------------------------------------------------------
#define flush fflush(stdout);
#define lb lower_bound
#define ub upper_bound
#define umap unordered_map
#define uset unordered_set
#define mset multiset
#define mxpque(T) priority_queue<T>
#define mnpque(T) priority_queue<T, vector<T>, greater<T>>
#define precise(x) cout << fixed << showpoint << setprecision(x);
#define setbit(x) __builtin_popcountll(x)
#define gcd(a, b) __gcd(a, b)
//------------------------------------------------------------------------------------------------------------------------------
const int mod = 1e9 + 7;
// ====== Useful functions begin ======
inline int add(int a, int b) { return ((a % mod) + (b % mod)) % mod; }
inline int sub(int a, int b) { return ((a % mod) - (b % mod) + mod) % mod; }
inline int mul(int a, int b) { return ((a % mod) * (b % mod)) % mod; }
// ====== Useful functions end ======
//--------------------------------------------------------------------------------------------------------------------------------
const int inf = 1e18;
const int maxn = 1e3 + 5;
//--------------------------------------------------------------------------------------------------------------------------------
int ans = inf;
int n, m, k;
vvi arr;
vi cost;
void help(int idx, int cst, vi &algo)
{
  if (idx == n)
  {
    int mn = inf;
    rep(i, 0, m) mn = min(mn, algo[i]);
    deb() << show(mn) show(k);
    if (mn >= k)
    {
      ans = min(ans, cst);
      deb() << show(ans);
    }
    return;
  }
  deb() << show(idx) show(cst) show(algo);
  //taken
  vi nalgo = algo;
  rep(i, 0, m)
  {
    nalgo[i] += arr[idx][i];
  }
  help(idx + 1, cst + cost[idx], nalgo);
  help(idx + 1, cst, algo);
}
void solve()
{

  cin >> n >> m >> k;

  cost = vi(n);
  arr = vvi(n, vi(m));
  rep(i, 0, n)
  {
    rep(j, 0, m + 1)
    {
      if (j == 0)
        cin >> cost[i];
      else
      {
        cin >> arr[i][j - 1];
      }
    }
  }
  vi algo(m, 0);
  help(0, 0, algo);
  if (ans == inf)
  {
    cout << -1 << endl;
  }
  else
  {
    cout << ans << endl;
  }
}
signed main()
{
  // freopen("input.txt", "r", stdin);
  // freopen("output.txt", "w", stdout);

  speed;
  int t = 1;
  // cin >> t;

  for (int tt = 1; tt <= t; tt++)
  {
    // cout<<"Case #"<<tt<<": ";
    solve();
  }

  //CERTAIN STUFF to REMEMBER::
  //1.Check integer overflow
  //2.Check edge case n=1 probable
  //3.If conditions can be checked without bits, then never check with bits, never try to be oversmart!
  //4.WA can come bcz of very silly things ->  base case, if with bits,bla bla
}

Measured memory_bytes: 3648