N,D,K=(int(x) for x in input().split())
A=list(map(int, input().split()))
C=list(map(int, input().split()))

inf = -10**12
dp=[[[inf]*(K+1) for i in range(D+1)] for j in range(N+1)]
dp[0][0][0] = 0

for i in range(N):
    for j in range(D+1):
        for k in range(K+1):
            if dp[i][j][k] != inf:
                dp[i+1][j][k] = max(dp[i+1][j][k], dp[i][j][k])
                if j < D:
                    dp[i+1][j+1][min(k+C[i],K)] = max(dp[i+1][j+1][min(k+C[i],K)], dp[i][j][k]+A[i])

if dp[-1][-1][-1] != inf:
    print(dp[-1][-1][-1])
else:
    print("No")