#include <bits/stdc++.h>
#include <bits/stdc++.h>
#include <bits/stdc++.h>
using namespace std;
// #include <atcoder/modint>
// using namespace atcoder;
// using mint = modint998244353;
using ll = long long;
#define fix(x) fixed << setprecision(x)
#define rep(i, n) for(int i = 0; i < n; ++i)
#define all(x) (x).begin(),(x).end()
template<class T>bool chmin(T&a, const T&b){if(a>b){a=b;return 1;}return 0;}
template<class T>bool chmax(T&a, const T&b){if(a<b){a=b;return 1;}return 0;}
constexpr ll INFLL = (1LL << 62), MOD = 998244353;
constexpr int INF = (1 << 30);

int main(){
    cin.tie(nullptr);
    ios::sync_with_stdio(false);
    int n,d,x;
    cin >> n >> d >> x;
    vector dp(d+1, vector<ll>(x+1,-INFLL));
    dp[0][0] = 0;
    vector<int> a(n), c(n);
    rep(i,n) cin >> a[i];
    rep(i,n) cin >> c[i];
    rep(i,n){
        for(int j=min(i,d-1);j>=0;--j)for(int k=x;k>=0;--k){
            if(dp[j][k]==-INFLL) continue;
            chmax(dp[j+1][min(x,k+c[i])], dp[j][k]+a[i]);
        }
    }
    if(dp[d][x]==-INFLL) cout << "No\n";
    else cout << dp[d][x] << '\n';
    return 0;
}