n,d,k = map(int,input().split())
a = list(map(int,input().split()))
c = list(map(int,input().split()))
inf = float('inf')
#i番目まででjこ採用、美しさk
dp = [[[-inf]*(k+1) for _ in range(d+1)] for _ in range(n+1)]
dp[0][0][0] = 0
for i in range(n):
    for j in range(d+1):
        for t in range(k+1):
            dp[i+1][j][t] = max(dp[i+1][j][t],dp[i][j][t])
            if j != d:
                dp[i+1][j+1][min(k,t+c[i])] = max(dp[i+1][j+1][min(k,t+c[i])], dp[i][j][t] + a[i])
print(dp[-1][-1][-1] if dp[-1][-1][-1] != -inf else "No")