#include <iostream>
#include <vector>
#include <algorithm>

using namespace std;

#define int long long

signed main() {
    int N, D, K;
    cin >> N >> D >> K;
    
    vector<int> A(N), C(N);
    for (int i = 0; i < N; i++) cin >> A[i];
    for (int i = 0; i < N; i++) cin >> C[i];
    
    vector<vector<int>> now(D + 1, vector<int>(K + 1, -1e18));
    now[0][0] = 0;
    
    for (int i = 0; i < N; i++) {
        vector<vector<int>> next(D + 1, vector<int>(K + 1, -1e18));
        for (int j = 0; j <= D; j++) {
            for (int k = 0; k <= K; k++) {
                // 選ばない場合
                next[j][k] = max(next[j][k], now[j][k]);
                
                // 選ぶ場合
                if (j + 1 > D) continue;
                next[j + 1][min(k + C[i], K)] = max(next[j + 1][min(k + C[i], K)], now[j][k] + A[i]);
            }
        }
        swap(now, next);
    }
    
    int result = now[D][K];
    if (result < -1e13) cout << "No" << endl;
    else cout << result << endl;
    
    return 0;
}