N, D, K = map(int, input().split())
A = list(map(int, input().split()))
C = list(map(int, input().split()))
# dp[i+1][j][k]:i番目までで、j個選んだ時に、美しさの合計がkであるような満足度の最大値
dp = [[[-(1 << 60)] * (K + 1) for _ in range(D + 1)] for _ in range(N + 1)]
dp[0][0][0] = 0
for i in range(N):
    a, c = A[i], C[i]
    for j in range(D + 1):
        for k in range(K + 1):
            # 取る
            if j - 1 >= 0 and k - c >= 0:
                dp[i + 1][j][k] = max(dp[i + 1][j][k], dp[i][j - 1][k - c] + a)
            # 取らない
            dp[i + 1][j][k] = max(dp[i + 1][j][k], dp[i][j][k])
ans = dp[N][D][K]
if ans < -N * 10**9:
    ans = "No"
print(ans)