MOD = 10 ** 9 + 7
INF = 10 ** 10
import sys
sys.setrecursionlimit(100000000)
dy = (-1,0,1,0)
dx = (0,1,0,-1)
from collections import deque
from heapq import heapify,heappush,heappop

def main():
    n,m,k = map(int,input().split())
    a = [list(map(int,input().split())) for _ in range(n)]

    dp = [[0] * (k + 1) for _ in range(n + 1)]
    dp[0][k] = 1
    for i in range(n):
        for money in range(k + 1):
            for j in range(m):
                if money + a[i][j] < k + 1:
                    dp[i + 1][money] |= dp[i][money + a[i][j]]
    
    ans = -1
    for i in range(k):
        if dp[-1][i]:
            ans = i
            break
    print(ans)

if __name__ =='__main__':
    main()