using System;
using System.Collections.Generic;
using System.Collections;
using System.Linq;
namespace Atcoder_0404
{
    class Program
    {
        static void Main(string[] args)
        {
            var NMX = GetInput_int();
            var _count_sankousyo = NMX[0];
            var _count_targetCount = NMX[1];
            var _targetRikaid = NMX[2];
            int[] _prices = new int[_count_sankousyo];
            int[][] _rikaids = new int[_count_sankousyo][];

            for(int i = 0; i < _count_sankousyo; i++)
            {
                var input = GetInput_int();
                _prices[i] = input[0];
                _rikaids[i] = new int[_count_targetCount];
                Array.Copy(input,1,_rikaids[i],0,_count_targetCount);
            }

            int _priceMin = -1;
            int[] lookList = new int[_count_sankousyo];
            Stack<int> _lookStack=new Stack<int>();
            while(_lookStack.Count< _count_sankousyo)
            {
                _lookStack.Push(0);
            }
            while (true)
            {
                var templist = _lookStack.ToArray();
                var tempsum = 0;
                var tempRikaid = new int[_count_targetCount];
                for(int i = 0; i < templist.Length; i++)
                {
                    if (templist[i] == 1)
                    {
                        tempsum += _prices[i];
                        for(int j = 0; j < _rikaids[i].Length; j++)
                        {
                            tempRikaid[j]+= _rikaids[i][j];
                        }
                    }
                }
                bool clear = true;
                for(int i = 0; i < _count_targetCount; i++)
                {
                    if (tempRikaid[i] < _targetRikaid)
                    {
                        clear = false;
                        break;
                    }
                }
                if (clear)
                {
                    if (_priceMin < 0&&tempsum>0)
                    {
                        _priceMin = tempsum;
                    }
                    else if (tempsum < _priceMin && tempsum > 0)
                    {
                        _priceMin = tempsum;
                    }
                }

                if (!templist.Contains(0)) break;

                var head = _lookStack.Pop();
                while (head == 1)
                {
                    head = _lookStack.Pop();
                }
                _lookStack.Push(1);
                while (_lookStack.Count< _count_sankousyo)
                {
                    _lookStack.Push(0);
                }
            }
            Console.WriteLine(_priceMin);
        }

        
        #region input
        

        static string[] GetInput_string()
        {
            var input = Console.ReadLine().Split(' ');
            return input;
        }

        static int[] GetInput_int()
        {
            var input = GetInput_string();
            var result = new int[input.Length];
            for (int i = 0; i < result.Length; i++)
            {
                result[i] = int.Parse(input[i]);
            }
            return result;
        }
        static long[] GetInput_long()
        {
            var input = GetInput_string();
            var result = new long[input.Length];
            for (int i = 0; i < result.Length; i++)
            {
                result[i] = long.Parse(input[i]);
            }
            return result;
        }
        #endregion
        #region sonota
        static void Swap_array<T>(T[] target, int a, int b)
        {
            T temp = target[a];
            target[a] = target[b];
            target[b] = temp;
        }
        static void Swap_list<T>(List<T> target, int a, int b)
        {
            T temp = target[a];
            target[a] = target[b];
            target[b] = temp;
        }
        /// <summary>
        /// 最大公約数
        /// </summary>
        public static int GCD(int a, int b)
        {

            /* 自然数 a > b を確認・入替 */
            if (a < b)
            {
                int tmp = a;
                a = b;
                b = tmp;
            }

            /* ユークリッドの互除法 */
            int r = a % b;
            while (r != 0)
            {
                a = b;
                b = r;
                r = a % b;
            }
            return b;
        }

        /// <summary>
        /// 最小公倍数
        /// </summary>
        public static int LCM(int a, int b)
        {
            int x = a * b;
            b = GCD(a, b);
            return x / b;

        }
        #endregion

        static long mod = 1000000000 + 7;
    }

}

Measured memory_bytes: 28784