n, m, k = map(int, input().split())
A = [list(map(int, input().split())) for _ in range(n)]

p = n//2
B = []

import itertools
for i in itertools.product(range(m), repeat=p):
    b = 0
    for j in range(p):
        b += A[j][i[j]]
    B.append(b)
#print(B)

C = []
for i in itertools.product(range(m), repeat=n-p):
    c = 0
    for j in range(p, n):
        c += A[j][i[j-p]]
    C.append(c)
#print(C)

import bisect
B.sort()
C.sort()
id = 0
ans = k
for b in B:
    id = bisect.bisect_right(C, k-b)
    if id == 0:
        break
    else:
        ans = min(ans, k-b-C[id-1])
if ans == k:
    print(-1)
else:
    print(ans)