// dfmt off
T lread(T=long)(){return readln.chomp.to!T;}T[] lreads(T=long)(long n){return iota(n).map!((_)=>lread!T).array;}
T[] aryread(T=long)(){return readln.split.to!(T[]);}void arywrite(T)(T a){a.map!text.join(' ').writeln;}
void scan(L...)(ref L A){auto l=readln.split;foreach(i,T;L){A[i]=l[i].to!T;}}alias sread=()=>readln.chomp();
void dprint(L...)(lazy L A){debug{auto l=new string[](L.length);static foreach(i,a;A)l[i]=a.text;arywrite(l);}}
static immutable MOD=10^^9+7;alias PQueue(T,alias l="b<a")=BinaryHeap!(Array!T,l);import std, core.bitop;
// dfmt on

void main()
{
    long N, M, X;
    scan(N, M, X);
    auto C = new long[](N);
    auto A = new long[][](N);
    foreach (i; 0 .. N)
    {
        auto tmp = aryread();
        C[i] = tmp[0];
        A[i] = tmp[1 .. $];
    }
    long ans = long.max;
    foreach (s; 0 .. 1 << N)
    {
        auto cnt = new long[](M);
        long cost;
        foreach (i; 0 .. N)
            if (s & (1 << i))
            {
                cost += C[i];
                cnt[] += A[i][];
            }
        if (cnt.all!(a => X <= a))
        {
            ans = ans.min(cost);
        }
    }
    writeln(ans == long.max ? -1 : ans);
}
