N, D, K = list(map(int, input().split()))
A = list(map(int, input().split()))
C = list(map(int, input().split()))

INF = float("inf")
dp = [[-INF] * (K + 1) for _ in range(D + 1)]

dp[0][0] = 0
for i in range(N):
    for d in range(D - 1, -1, -1):
        for k in range(K - 1, -1, -1):
            if dp[d][k] == -INF:
                continue
            nk = min(K, k + C[i])
            dp[d + 1][nk] = max(dp[d + 1][nk], dp[d][k] + A[i])

if dp[D][K] == -INF:
    print("No")
else:
    print(dp[D][K])