N,D,K=map(int,input().split())
INF=-10**18
dp=[[INF]*(K+1) for _ in range(D+1)]
dp[0][0]=0
A=list(map(int,input().split()))
C=list(map(int,input().split()))

for i in range(N):
    ndp=[[INF]*(K+1) for _ in range(D+1)]
    a,c=A[i],C[i]
    for j in range(D+1):
        for k in range(K+1):
            if dp[j][k]==INF:continue
        
            ndp[j][k]=max(ndp[j][k],dp[j][k])
            if j<D:
                ndp[j+1][min(K,k+c)]=max(ndp[j+1][min(K,k+c)],dp[j][k]+a)

    dp=ndp

if dp[D][K]==INF:
    print('No')
else:
    print(dp[D][K])