n,d,k=map(int,input().split())
A=list(map(int,input().split()))
C=list(map(int,input().split()))

dp=[[[-float('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 l in range(k+1):
            dp[i+1][j][l]=max(dp[i+1][j][l],dp[i][j][l])
            if (j+1<d+1):dp[i+1][j+1][min(k,l+C[i])]=max(dp[i+1][j+1][min(k,l+C[i])],dp[i][j][l]+A[i])

print(dp[n][d][k] if dp[n][d][k]!=-float('INF') else "No")