import sys

INF = float('-inf')

n, d, k = map(int, sys.stdin.readline().split())
a = list(map(int, sys.stdin.readline().split()))
c = list(map(int, sys.stdin.readline().split()))
    
dp = [[INF] * (k + 1) for _ in range(d + 1)]
dp[0][0] = 0
    
for i in range(n):
    for j in range(d - 1, -1, -1):
        for l in range(k, -1, -1):
            if dp[j][l] != INF:
                new_k = min(k, l + c[i])
                dp[j + 1][new_k] = max(dp[j + 1][new_k], dp[j][l] + a[i])
    
ans = dp[d][k]
if ans == INF:
    print("No")
else:
	print(ans)