#include <bits/stdc++.h>

using namespace std;

long long INF = 1LL << 60;

int main() {
    int N, D, K;
    cin >> N >> D >> K;
    vector<vector<vector<long long>>> dp(N + 1, vector<vector<long long>>(D + 1, vector<long long>(K + 1, -INF)));
    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];
    }
    dp[0][0][0] = 0;
    for (int i = 1; i <= N; i++) {
        dp[i][1][min(K, C[i - 1])] = A[i - 1];
        for (int j = 1; j <= D; j++) {
            if (j > i) continue;
            for (int k = 1; k <= K; k++) {
                dp[i][j][k] = max(dp[i][j][k], dp[i - 1][j][k]);
            }                
            for (int k = 1; k <= K; k++) {
                if (k - C[i - 1] >= 0 && dp[i - 1][j - 1][k - C[i - 1]] != -INF) {
                    dp[i][j][k] = max(dp[i][j][k], dp[i - 1][j - 1][k - C[i - 1]] + A[i - 1]);
                }
            }
        }
    }
    if (dp[N][D][K] == -INF) {
        cout << "No" << endl;
    } else {
        cout << dp[N][D][K] << endl;
    }
    return 0;
}