#include <bits/stdc++.h>
#include <cstdlib>
#include <math.h>
using namespace std;

using ll = long long;

int main(){
    int n,d,k;
    cin >> n >> d >> k;
    vector<ll>a(n),c(n);
    for(int i=0;i<n;i++)cin >> a[i];
    for(int i=0;i<n;i++)cin >> c[i];
    vector<vector<ll>>dp (d+1,
    vector<ll>(k+1,-(1LL<<60)));
    dp[0][0]=0;
    for(int i=0;i<n;i++){
        auto ep = dp;
        for(int j=0;j<=d;j++){
            for(int l=0;l<=k;l++){
                if(dp[j][l]==-(1LL<<60))continue;
                if(j==d)continue;
                ep[j+1][min(ll(k),l+c[i])] =max(ep[j+1][min(ll(k),l+c[i])],dp[j][l]+a[i]);
            }
        }
        dp = ep;
    }
    if(dp[d][k] == -(1LL<<60)){
        cout << "No" << endl;
    }else cout << dp[d][k] << endl;
    return 0;
}