#include <bits/stdc++.h>
#include <atcoder/all>
using namespace std;
using namespace atcoder;
using ll = long long;
using ld = long double;
using ull = unsigned long long;
using Graph = vector<vector<int>>;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define all(v) (v).begin(), (v).end()
#define rall(v) (v).rbegin(), (v).rend()
#define NP next_permutation
const int INF32 = 2e9;
const ll INF64 = 2e18;
const ll mod = 998244353;
// const ll mod = 1e9 + 7;
template<typename T> bool chmin(T &a, T b){if(a > b){a = b; return true;} return false;}
template<typename T> bool chmax(T &a, T b){if(a < b){a = b; return true;} return false;}
 
void cincout() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    cout << fixed << setprecision(15);
}
 
int main() {
    cincout();
 
    ll 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];

    vector<vector<vector<ll>>> dp(N + 1, vector<vector<ll>>(D + 1, vector<ll>(501, -INF64))); //dp[i][j][k]:iまででj個選び、美しさがkになった時の満足度の最大値
    dp[0][0][0] = 0;
    for (ll i = 0; i < N; i++) {
        for (ll j = 0; j <= D; j++) {
            for (ll k = 0; k <= 500; k++) {
                if (dp[i][j][k] == -INF64) continue;
                //選ぶとき
                if (j < D) chmax(dp[i + 1][j + 1][min(k + C[i], 500LL)], dp[i][j][k] + A[i]);
                //選ばないとき
                chmax(dp[i + 1][j][k], dp[i][j][k]);
            }
        }
    }

    ll ans = -INF64;
    for (int k = K; k <= 500; k++) chmax(ans, dp[N][D][k]);
    if (ans != -INF64) cout << ans << endl;
    else cout << "No" << endl;
}