#include <bits/stdc++.h>
using namespace std;
using ll = long long;
ll rinf = -(1LL<<60);

int main(){
    int n,d,k;
    cin >> n >> d >> k;

    vector<vector<vector<ll>>>dp (n+1,vector<vector<ll>>(d+1,vector<ll>(k+1,rinf)));
    dp[0][0][0] = 0;
    vector<pair<ll,int>>que (n);

    for(int i=0;i<n;i++) cin >> que[i].first;
    for(int j=0;j<n;j++) cin >> que[j].second;

    for(int i=0;i<n;i++){
        auto[st,bt] = que[i];
        for(int j=0;j<=d;j++){
            for(int s=0;s<=k;s++){
                if(dp[i][j][s] == rinf) continue;

                dp[i+1][j][s] = max(dp[i+1][j][s], dp[i][j][s]);
                if(j != d) dp[i+1][j+1][min(s+bt,k)] = max(dp[i+1][j+1][min(s+bt,k)],dp[i][j][s] + st);
            }
        }
    }

    if(dp[n][d][k] == rinf) cout << "No" << endl;
    else cout << dp[n][d][k] << endl;
}