#include <bits/stdc++.h>
#include <atcoder/all>
using namespace std;
using namespace atcoder;
using ll = long long;
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return true; } return false; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return true; } return false; }
ll inf_ll = 9223372036854775807;
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
using mint = atcoder::modint998244353;
using mint1 = atcoder::modint1000000007;
using Pa = std::pair<ll, ll>;

int Yes(bool x){
    if(x) cout << "Yes";
    else cout << "No";
    cout << endl;
    return 0;
}

int main(){
    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<vector<vector<ll>>> dp(N+1, vector<vector<ll>>(D+1, vector<ll>(K+1, -1e18)));
    dp[0][0][0] = 0;
    rep(i, N){
        rep(j, D+1){
            rep(k, K+1){
                if(dp[i][j][k] == -1e18) continue;
                chmax(dp[i+1][j][k], dp[i][j][k]);
                if(j == D) continue;
                if(C[i]+k >= K){
                    chmax(dp[i+1][j+1][K], dp[i][j][k]+A[i]);
                }
                else{
                    chmax(dp[i+1][j+1][C[i]+k], dp[i][j][k]+A[i]);
                }
            }
        }
    }
    if(dp[N][D][K] == -1e18){
        cout << "No";
    }
    else{
        cout << dp[N][D][K];
    }
}