import sys
import math
import bisect
from heapq import heapify, heappop, heappush
from collections import deque, defaultdict, Counter
from functools import lru_cache
from itertools import accumulate, combinations, permutations, product

sys.set_int_max_str_digits(10 ** 6)
sys.setrecursionlimit(1000000)
MOD = 10 ** 9 + 7
MOD99 = 998244353

input = lambda: sys.stdin.readline().strip()
NI = lambda: int(input())
NMI = lambda: map(int, input().split())
NLI = lambda: list(NMI())
SI = lambda: input()
SMI = lambda: input().split()
SLI = lambda: list(SMI())
EI = lambda m: [NLI() for _ in range(m)]


def main():
    N, D, K = NMI()
    A = NLI()
    C = NLI()
    INF = 10**17
    # i問見て採用した個数がjで美しさがkのときの満足度のmax
    dp = [[-INF for _ in range(K+1)] for _ in range(D+1)]
    dp[0][0] = 0
    for i in range(N):
        dp2 = [[-INF for _ in range(K + 1)] for _ in range(D + 1)]
        a, c = A[i], C[i]
        for j in range(D+1):
            for k in range(K+1):
                d = dp[j][k]
                if d < -INF // 10:
                    continue
                dp2[j][k] = max(dp2[j][k], d)
                if j < D:
                    dp2[j+1][min(K, k+c)] = max(dp2[j+1][min(K, k+c)], d + a)
        dp, dp2 = dp2, dp
    ans = dp[D][K]
    # print(dp[N])
    print(ans if ans > -INF // 10 else "No")


if __name__ == "__main__":
    main()