# -*- coding: utf-8 -*-
from itertools import product
from bisect import bisect
import sys
#input = sys.stdin.readline
def inpl(): return list(map(int, input().split()))

N, M, K = inpl()
A = [inpl() for _ in range(N)]
ans = -1
h = N//2

L = []
for J in product(range(M), repeat=h):
    tmp = 0
    for i, j in enumerate(J):
        tmp += A[i][j]
    if tmp <= K:
        L.append(tmp)

L = sorted(L)

for J in product(range(M), repeat=N-h):
    tmp = 0
    for i, j in enumerate(J):
        tmp += A[i+h][j]
    r = bisect(L, K-tmp)
    if r:
        ans = max(ans, tmp+L[r-1])

print(K-ans if ans >= 0 else -1)