#include <iostream>
#include <vector>
#include <algorithm>
#include <atcoder/all>
using namespace std;
using namespace atcoder;
using ll = long long;
using mint = modint998244353;
#define rep(i, n) for (int i = 0; i< (int)(n); i++) 
ll inf = 4e18;
ll inf2 = 1e14;

int main(){
    ios::sync_with_stdio(false);
    std::cin.tie(nullptr);
    int 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<ll>> dp(d+1, vector<ll>(k+2, -inf));
    dp[0][0] = 0;
    if(c[0] <= k){
        dp[1][c[0]] = a[0];
    }
    if(c[0] >= k)dp[1][k+1] = a[0];
    
    for(int i=1; i<n; i++){
        for(int j = d; j >=0; j--){
            if(j == 0){
                dp[j][0] = 0;
                continue;
            }
            for(int l = k; l>=0; l--){  
                if(l - c[i] >= 0){
                    dp[j][l] = max(dp[j][l], dp[j-1][l-c[i]] + a[i]);
                }
            }

            ll tmp = dp[j][k];
            for(int l = k+1; l + c[i] > k ; l--){
                tmp = max(tmp, dp[j-1][l] + a[i]);
            }
            dp[j][k+1] = max(dp[j][k+1], tmp);
        }
    }
    if(dp[d][k+1] > -inf2){
        cout << dp[d][k+1] << endl;
    }else{
        cout << "No" << endl;
    }

    return 0;
}