from heapq import heappop, heappush, heapify
from bisect import bisect
#from sortedcontainers import SortedList
from collections import deque, defaultdict
from math import floor, ceil, isqrt, comb
from sys import stdin, setrecursionlimit
#setrecursionlimit(10**7)
intin = lambda: int(stdin.readline())
strin = lambda: stdin.readline().rstrip()
listin = lambda: list(map(int, stdin.readline().split()))
tuplein = lambda m: [tuple(map(lambda x: int(x) if x.isdigit() or (len(x) > 1 and x[0] == "-" and x[1:].isdigit()) else x, stdin.readline().split())) for _ in range(m)]
gridin = lambda m: [list(map(int, stdin.readline().split())) for _ in range(m)]
strgridin = lambda h: [stdin.readline().rstrip() for _ in range(h)]
mapin = lambda: map(int, stdin.readline().split())
N, D, K = mapin()
A = listin()
C = listin()
dp = [[[-float("inf")] * (K + 1) for _ in range(D + 1)] for _ in range(N + 1)]
#dp[i][j][k] = i?????????????????????????????????k????????????????????????
dp[0][0][0] = 0
for i in range(N):
    for j in range(D + 1):
        for k in range(K + 1):
            dp[i+1][j][k] = max(dp[i+1][j][k], dp[i][j][k])
            if j + 1 <= D:
                dp[i+1][j+1][min(K,k+C[i])] = max(dp[i+1][j+1][min(K,k+C[i])], dp[i][j][k] + A[i])
print(dp[N][D][K] if dp[N][D][K] != -float("inf") else "No")