#include<bits/stdc++.h>
using namespace std;
using ll = long long;
#define all(a) begin(a) end(a)
#define rep(i,a,b) for(ll i = a; i < (b); i++)

const ll minf = -1e18;

int main(){
    ll n,d,k;
    cin >> n >> d >> k;
    vector<vector<ll>> dp(d+1, vector<ll>(k+1, minf));
    vector<ll> a(n), c(n);
    rep(i,0,n) cin >> a[i];
    rep(i,0,n) cin >> c[i];

    dp[0][0] = 0;

    rep(i,0,n){
        vector<vector<ll>> next(d+1, vector<ll>(k+1, minf));
        rep(j,0,d+1){
            rep(l,0,k+1){
                next[j][l] = max(next[j][l], dp[j][l]);
                if(j < d) next[j+1][min(l+c[i], k)] = max(next[j+1][min(l+c[i], k)], dp[j][l] + a[i]);
            }
        }
        dp.swap(next);
    }

    ll ans = dp[d][k];
    if(ans < -1e14){
        cout << "No" << endl;
    }else{
        cout << ans << endl;
    }
}