#include <bits/stdc++.h>
using namespace std;

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

    long long N, D, K;
    cin >> N >> D >> K;
    vector<long long> A(N), C(N);
    for(int i = 0; i < N; i++) cin >> A[i];
    for(int i = 0; i < N; i++) cin >> C[i];

    const long long INF = (long long)1e18;
    vector<vector<long long>> pre(D+1, vector<long long>(K+1, -INF));
    pre[0][0] = 0;

    for(int i = 0; i < N; i++){
        vector<vector<long long>> dp(D+1, vector<long long>(K+1, -INF));
        for(int d = 0; d <= D; d++){
            for(int k = 0; k <= K; k++){
                if(pre[d][k] == -INF) continue;
                dp[d][k] = max(dp[d][k], pre[d][k]);
                if(d != D){
                    long long nd = d + 1;
                    long long nk = min((long long)K, k + C[i]);
                    dp[nd][nk] = max(dp[nd][nk], pre[d][k] + A[i]);
                }
            }
        }
        pre = dp;
    }

    if(pre[D][K] >= -INF / 2){
        cout << pre[D][K] << "\n";
    } else {
        cout << "No\n";
    }
    return 0;
}