# YC3014
N,D,K = map(int,input().split())
A = list(map(int,input().split()))
C = list(map(int,input().split()))
INF = 10 ** 12
dp = [[-INF] * (K+1) for _ in range(D + 1)]
dp[0][0] = 0
for i in range(N):
    a = A[i]
    c = C[i]
    for j in reversed(range(D)):
        for k in reversed(range(K + 1)):
            if dp[j][k] == -INF:
                continue
            dp[min(D,j+1)][min(K,k+c)] = max(dp[min(D,j+1)][min(K,k+c)],dp[j][k] + a)


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