import sys

sys.setrecursionlimit(10**6)
int1 = lambda x: int(x)-1
p2D = lambda x: print(*x, sep="\n")
def II(): return int(sys.stdin.buffer.readline())
def LI(): return list(map(int, sys.stdin.buffer.readline().split()))
def LI1(): return list(map(int1, sys.stdin.buffer.readline().split()))
def LLI(rows_number): return [LI() for _ in range(rows_number)]
def LLI1(rows_number): return [LI1() for _ in range(rows_number)]
def BI(): return sys.stdin.buffer.readline().rstrip()
def SI(): return sys.stdin.buffer.readline().rstrip().decode()
# dij = [(0, 1), (-1, 0), (0, -1), (1, 0)]
dij = [(0, 1), (-1, 0), (0, -1), (1, 0), (1, 1), (1, -1), (-1, 1), (-1, -1)]
inf = 10**16
# md = 998244353
md = 10**9+7

n, m, k = LI()
aa = LLI(n)

if n == 1:
    ans = min(k-a for a in aa[0] if k-a >= 0)
    print(ans)
    exit()

pre = aa[0][:]
for i in range(1, n//2):
    pre = [a+p for a in aa[i] for p in pre]
pre.sort()
# print(pre)

pos = aa[n//2][:]
for i in range(n//2+1, n):
    pos = [a+p for a in aa[i] for p in pos]
pos.sort()
# print(pos)

ans = inf
i = len(pos)-1
for a in pre:
    while i >= 0 and a+pos[i] > k: i -= 1
    if i < 0: break
    ans = min(ans, k-a-pos[i])

if ans == inf: ans = -1
print(ans)