N,D,K=map(int,input().split())
A=list(map(int,input().split()))
C=list(map(int,input().split()))
if sum(C)<K:
    print('No')
    exit()

dp=[[-10**18]*(K+1) for _ in range(D+1)]
dp[0][0]=0
for i in range(N):
    ai=A[i]
    ci=C[i]
    ndp=[i[:] for i in dp]
    for j in range(D):
        for k in range(K+1):
            nj=j+1
            nk=min(k+ci,K)
            ndp[nj][nk]=max(ndp[nj][nk],dp[j][k]+ai)
    dp=ndp

print(dp[D][K])