#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;

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<vector<ll>>> dp(n, vector<vector<ll>>(d+1, vector<ll>(k+2, -inf)));
    dp[0][0][0] = 0;
    if(c[0] <= k){
        dp[0][1][c[0]] = a[0];
    }
    if(c[0] >= k)dp[0][1][k+1] = a[0];
    
    for(int i=1; i<n; i++){
        rep(j, d+1){
            rep(l, k+1){
                if(j == 0){
                    if(l == 0)dp[i][j][l] = 0;
                    continue;                    
                }
                if(l >= c[i]){
                    dp[i][j][l] = max(dp[i-1][j][l], dp[i-1][j-1][l-c[i]] + a[i]);
                }else{
                    dp[i][j][l] = dp[i-1][j][l];
                }
            }
            
            if(j == 0)continue;
            ll tmp = max(dp[i][j][k], dp[i-1][j][k+1]);
            for(int l = max((ll)0, k-c[i]); l <=k+1; l++){
                tmp = max(tmp, dp[i-1][j-1][l] + a[i]);
            }
            dp[i][j][k+1] = tmp;
        }
    }
    if(dp[n-1][d][k+1] > -inf){
        cout << dp[n-1][d][k+1] << endl;
    }else{
        cout << "No" << endl;
    }

    return 0;
}