import java.util.*;
import java.io.*;
import java.util.stream.Collectors;

public class Main {
    public static final long MOD = 1000000007;

    public static void main(String[] args) {
        FastScanner sc = new FastScanner();
        PrintWriter out = new PrintWriter(System.out);
        Integer i,j,k,n=0,m=0,h=0,w=0;
        long a=0,b=0,c=0,x=0,y=0,z=0,ans=0;
        List<Integer> l = new ArrayList<>();
        List<String> s = new ArrayList<>();
        List<Pair> p = new ArrayList<>();
        List<List<Integer>> ll = new ArrayList<>();
        Set<String> st = new HashSet<>();

        n = sc.nextInt();
        m = sc.nextInt();
        k = sc.nextInt();

        int[][] data = new int[n][m+1];
        int[] map = new int[m];
        Arrays.fill(map, 0);

        for(i=0;i<n;i++){
            for(j=0;j<m+1;j++){
                data[i][j]=sc.nextInt();
            }
        }

        h = dfs(data,map,0,0,m,n,k);
        if (h == Integer.MAX_VALUE){
            print(-1);            
        } else {
            print(h);
        }

    }

    private static int dfs(int[][] data, int[] map, int depth, int score, int kind, int book, int need){
        if (depth == book){
            for(int i=0;i<kind;i++){
                if (map[i]<need){
                    return Integer.MAX_VALUE;
                }
            }
            return score;
        }
        int ans1 = dfs(data,map,depth+1,score,kind,book,need);

        for(int i=0;i<kind;i++)
            map[i]+=data[depth][i+1];

        int ans2 = dfs(data,map,depth+1,score+data[depth][0],kind,book,need);

        for(int i=0;i<kind;i++)
            map[i]-=data[depth][i+1];

        return Math.min(ans1, ans2);

    }

    private static void print(Object o) {
        System.out.println(o.toString());
    }

    private static long lcm(long m, long n) {
        return m * n / gcd(m, n);
    }

    private static long gcd(long m, long n) {
        if(m < n) return gcd(n, m);
        if(n == 0) return m;
        return gcd(n, m % n);
    }

    private static class Pair {
        private int key;
        private int value;

        public Pair(int key, int value){
            this.key=key;
            this.value=value;
        }

        public int getValue(){
            return this.value;
        }

        public int getKey(){
            return this.key;
        }

        public void setValue(int value){
            this.value = value;
        }
    }
}

class FastScanner {
    private final InputStream in = System.in;
    private final byte[] buffer = new byte[1024];
    private int ptr = 0;
    private int buflen = 0;
    private boolean hasNextByte() {
        if (ptr < buflen) {
            return true;
        }else{
            ptr = 0;
            try {
                buflen = in.read(buffer);
            } catch (IOException e) {
                e.printStackTrace();
            }
            if (buflen <= 0) {
                return false;
            }
        }
        return true;
    }
    private int readByte() { if (hasNextByte()) return buffer[ptr++]; else return -1;}
    private static boolean isPrintableChar(int c) { return 33 <= c && c <= 126;}
    public boolean hasNext() { while(hasNextByte() && !isPrintableChar(buffer[ptr])) ptr++; return hasNextByte();}
    public String next() {
        if (!hasNext()) throw new NoSuchElementException();
        StringBuilder sb = new StringBuilder();
        int b = readByte();
        while(isPrintableChar(b)) {
            sb.appendCodePoint(b);
            b = readByte();
        }
        return sb.toString();
    }
    public long nextLong() {
        if (!hasNext()) throw new NoSuchElementException();
        long n = 0;
        boolean minus = false;
        int b = readByte();
        if (b == '-') {
            minus = true;
            b = readByte();
        }
        if (b < '0' || '9' < b) {
            throw new NumberFormatException();
        }
        while(true){
            if ('0' <= b && b <= '9') {
                n *= 10;
                n += b - '0';
            }else if(b == -1 || !isPrintableChar(b)){
                return minus ? -n : n;
            }else{
                throw new NumberFormatException();
            }
            b = readByte();
        }
    }
    public int nextInt() {
        long nl = nextLong();
        if (nl < Integer.MIN_VALUE || nl > Integer.MAX_VALUE) throw new NumberFormatException();
        return (int) nl;
    }
    public double nextDouble() { return Double.parseDouble(next());}
}


Measured memory_bytes: 33872