#ifdef LOCAL
#define _GLIBCXX_DEBUG
#endif
#include <bits/stdc++.h>
#include <atcoder/all>
using namespace atcoder;
using namespace std;
#define ll long long
#define rep(i,n) for(ll i=0;i<(ll)n;i++)
#define all(v) v.begin(),v.end()
const ll INF = (ll)2e18;

int main(){
    cin.tie(0);
    ios::sync_with_stdio(false);

    ll N, D, K;
    cin >> N >> D >> K;
    vector<ll> A(N), C(N);
    rep(i, N) cin >> A[i];
    rep(i, N) cin >> C[i];
    vector<ll> copy = C;
    sort(all(copy));
    reverse(all(copy));
    ll sum = 0;
    rep(i,D){
        sum += copy[i];
    }
    if(sum<K){
        cout << "No" << endl;
        return 0;
    }

    //dp[i][j][k]:i番目まででk個使った際の美しさjの時の満足度のmax
    vector<vector<vector<ll>>> dp(N + 1, vector<vector<ll>>(K + 1,vector<ll>(D+1,-INF)));
    dp[0][0][0] = 0;
    rep(i,N){
        rep(j,K+1){
            rep(k,D+1){
                dp[i + 1][j][k] = dp[i][j][k];
            }
        }
        rep(j,K+1){
            rep(k,D){
                dp[i + 1][min(j + C[i], K)][k + 1] = max(dp[i + 1][min(j + C[i], K)][k + 1], dp[i][j][k] + A[i]);
            }
        }
    }
    cout << dp[N][K][D] << endl;
}