N, D, K = map(int, input().split())
A = list(map(int, input().split()))
C = list(map(lambda x: min(K, int(x)), input().split()))

INF = 1 << 60
dp = [[-INF] * (K + 1) for _ in range(D + 1)]
dp[0][0] = 0
for a, c in zip(A, C):
    for d in range(D - 1, -1, -1):
        for k in range(K, 0, -1):
            if dp[d][k] == -INF:
                continue
            nk = min(K, k + c)
            dp[d + 1][nk] = max(dp[d + 1][nk], dp[d][k] + a)

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