n,m,k=map(int,input().split())
dp=[[0]*(k+1) for _ in range(n+1)]
dp[0][0]=1
item=[list(map(int,input().split())) for _ in range(n)]
for i in range(n):
    lis=item[i]
    for j in range(k+1):
        if dp[i][j]==0:
            continue
        for p in lis:
            if j+p<=k:
                dp[i+1][j+p]|=dp[i][j]
ans=k
for i in range(k+1):
    if dp[-1][i]:
        ans=min(ans,k-i)
if ans==k:
    print(-1)
else:
    print(ans)