using System;
using System.Collections;
using System.Collections.Generic;
using System.Collections.Specialized;
using System.Linq;
using System.Numerics;

namespace AtCoderWorkspace
{
    public class Solver
    {
        public void Solve()
        {
            var cin = new Scanner();
            var n = cin.nextInt();
            var m = cin.nextInt();
            var x = cin.nextInt();

            var list = new List<Book>();
            for (int i = 0; i < n; i++)
            {
                var cost = cin.nextInt();
                var a = cin.ArrayInt(m).ToList();
                list.Add(new Book() { cost = cost, algo = a });
            }

            var ans = long.MaxValue;
            var ex = false;
            for (int bit = 0; bit < Math.Pow(2, n); bit++)
            {
                var bits = new bool[n];
                for (int i = 0; i < n; i++)
                {
                    var t = bit & (1 << i);
                    bits[n - i - 1] = t > 0; // 001 == bool{F,F,T}

                    var tmpCost = 0;
                    var rikai = new int[m];
                    for (int k = 0; k < n; k++)
                    {
                        if(bits[k] == true)
                        {
                            tmpCost += list[k].cost;
                            var al = list[k].algo;
                            for (int l = 0; l < m; l++) rikai[l] += al[l];
                        }
                    }

                    // rikaiがすべてxを超えているなら
                    var bb = rikai.All(item => item >= x);
                    if (bb)
                    {
                        ans = Math.Min(tmpCost, ans);
                        ex = true;
                    }
                }
            }
            Console.WriteLine(ex?ans:-1);
        }
    }

    class Book
    {
        public int cost { get; set; }
        public List<int> algo { get; set; }
    }

    class Scanner
    {
        string[] s;
        int i;

        char[] cs = new char[] { ' ' };

        public Scanner()
        {
            s = new string[0];
            i = 0;
        }

        public string next()
        {
            if (i < s.Length) return s[i++];
            string st = Console.ReadLine();
            while (st == "") st = Console.ReadLine();
            s = st.Split(cs, StringSplitOptions.RemoveEmptyEntries);
            if (s.Length == 0) return next();
            i = 0;
            return s[i++];
        }

        public int nextInt()
        {
            return int.Parse(next());
        }
        public int[] ArrayInt(int N, int add = 0)
        {
            int[] Array = new int[N];
            for (int i = 0; i < N; i++)
            {
                Array[i] = nextInt() + add;
            }
            return Array;
        }

        public int[] DPArrayInt(int N, int ex)
        {
            int[] Array = new int[N + ex];
            for (int i = 0; i < N; i++)
            {
                Array[i] = nextInt();
            }
            return Array;
        }

        public long nextLong()
        {
            return long.Parse(next());
        }

        public long[] ArrayLong(int N, long add = 0)
        {
            long[] Array = new long[N];
            for (int i = 0; i < N; i++)
            {
                Array[i] = nextLong() + add;
            }
            return Array;
        }

        public long[] DPArrayLong(int N, int ex)
        {
            long[] Array = new long[N + ex];
            for (int i = 0; i < N; i++)
            {
                Array[i] = nextLong();
            }
            return Array;
        }

        public double nextDouble()
        {
            return double.Parse(next());
        }


        public double[] ArrayDouble(int N, double add = 0)
        {
            double[] Array = new double[N];
            for (int i = 0; i < N; i++)
            {
                Array[i] = nextDouble() + add;
            }
            return Array;
        }
    }

    class Program
    {
        static void Main(string[] s) => new Solver().Solve();
    }
}


Measured memory_bytes: 33408