def main():
    DP_MIN = -int(1e16)
    N, D, K = map(int, input().split())
    A = list(map(int, input().split()))
    C = list(map(int, input().split()))
    dp_table = [[[DP_MIN for _ in range(K+1)]
                 for _ in range(D+1)] for _ in range(2)]
    dp_table[0][0][0] = 0
    for sa, beau in zip(A, C):
        for cur_d in range(D+1):
            for cur_k in range(K+1):
                if dp_table[0][cur_d][cur_k] == DP_MIN:
                    continue
                dp_table[1][cur_d][cur_k] = max(
                    dp_table[1][cur_d][cur_k],
                    dp_table[0][cur_d][cur_k]
                )
                if cur_d == D:
                    continue
                next_k = min(cur_k+beau, K)
                dp_table[1][cur_d+1][next_k] = max(
                    dp_table[1][cur_d+1][next_k],
                    dp_table[0][cur_d][cur_k] + sa
                )
        dp_table[0] = dp_table[1]
        dp_table[1] = [[DP_MIN for _ in range(K+1)] for _ in range(D+1)]
    ans = dp_table[0][-1][-1]
    if ans == DP_MIN:
        print("No")
        return
    print(ans)


if __name__ == "__main__":
    main()