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

#ifdef LOCAL
#include <debug.hpp>
#else
#define debug(...)
#endif

constexpr ll INF = 1LL << 60;

int main() {
    cin.tie(nullptr);
    ios::sync_with_stdio(false);
    cout << fixed << setprecision(20);
    int N, D, K;
    cin >> N >> D >> K;
    vector<ll> 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[i][j] := i 番目まで見て, j 個選んだとき, 美しさが j のときの満足度の最大値
    vector dp(D + 1, vector<ll>(K + 1, -INF));
    dp[0][0] = 0;
    for (int i = 0; i < N; i++) {
        for (int j = D - 1; j >= 0; j--) {
            for (int k = 0; k <= K; k++) {
                if (dp[j][k] == -INF) continue;
                dp[j + 1][min<ll>(K, k + C[i])] = max(dp[j + 1][min<ll>(K, k + C[i])], dp[j][k] + A[i]);
            }
        }
    }

    if (dp[D][K] == -INF) {
        cout << "No" << "\n";
    } else {
        cout << dp[D][K] << "\n";
    }
}