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

using namespace std;

int 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<vector<int>>> dp(N + 1, vector<vector<int>>(D + 1, vector<int>(K + 1, numeric_limits<int>::min())));
    dp[0][0][0] = 0;

    for (int i = 0; i < N; ++i) {
        for (int j = 0; j <= D; ++j) {
            for (int k = 0; k <= K; ++k) {
                if (dp[i][j][k] == numeric_limits<int>::min()) continue;

                // 選ばない
                dp[i + 1][j][k] = max(dp[i + 1][j][k], dp[i][j][k]);

                // 選ぶ
                if (j + 1 > D) continue;
                dp[i + 1][j + 1][min(k + C[i], K)] = max(dp[i + 1][j + 1][min(k + C[i], K)], dp[i][j][k] + A[i]);
            }
        }
    }

    int result = dp[N][D][K];
    if (result == numeric_limits<int>::min()) {
        cout << "No" << endl;
    } else {
        cout << result << endl;
    }

    return 0;
}