#include <bits/stdc++.h>
//#include <atcoder/modint>

using namespace std;
//using namespace atcoder;
using ll = long long;
//using mint = modint998244353;

int main(){
    cin.tie(nullptr);
    ios_base::sync_with_stdio(false);

    /*
       dp(i,j,k)=i問目までで美しさがjでk問採用している
    */

    ll N, D, K, a, c;
    cin >> N >> D >> K;
    vector<ll> A(N+1), C(N+1);
    for (int i=1; i<=N; i++) cin >> A[i];
    for (int i=1; i<=N; i++) cin >> C[i];
    const ll inf = -1e18;
    vector dp(K+1, vector<ll>(D+1, inf));
    dp[0][0] = 0;
    for (int i=1; i<=N; i++){
        a = A[i]; c = C[i];
        vector pd(K+1, vector<ll>(D+1, inf));
        for (int j=0; j<=K; j++){
            for (int k=0; k<=D; k++){
                if (dp[j][k] == inf) continue;
                pd[j][k] = max(pd[j][k], dp[j][k]);
                if (k+1 <= D) pd[min(j+c, K)][k+1] = max(pd[min(j+c, K)][k+1], dp[j][k]+a);
            }
        }
        swap(dp, pd);
    }
    if (dp[K][D] == inf){
        cout << "No" << endl;
        return 0;
    }
    cout << dp[K][D] << endl;

    return 0;
}