#ifndef ONLINE_JUDGE
#define _GLIBCXX_DEBUG
#endif
#include <bits/stdc++.h>
#include <atcoder/all>
using namespace atcoder;
using namespace std;
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
#define ll long long
#define bigmod 1000000007
#define P pair<ll,ll>
#define T tuple<ll,ll,ll>
#define nall(a) a.begin(),a.end()
#define rall(a) a.rbegin(),a.rend()//逆順ソート
#define inf 2000000000000000000LL
#define mint modint998244353
#define mkp make_pair
#define mkt make_tuple
template<class X> using priority_minq = priority_queue<X, vector<X>, greater<X>>;//小さい順
ll min(ll a1,ll b1){if(a1>b1)return b1;else return a1;}
ll max(ll a1,ll b1){if(a1>b1)return a1;else return b1;}
#define chmax(x,y) x = max(x,y)
#define chmin(x,y) x = min(x,y)

//cout << fixed << setprecision(10); double型出力するときに使うやつ

ll n,d,k;
ll a[509],c[509];
ll dp[3][509][509];

int main(){
    cin >> n >> d >> k;
    rep(i,n)cin >> a[i+1];
    rep(i,n)cin >> c[i+1];
    rep(i,3)rep(j,n+1)rep(l,k+2)dp[i][j][l] = -inf;
    dp[0][0][0] = 0;
    rep(i,n){
        rep(j,d+1)rep(l,k+1)dp[(i+1)%3][j][l] = dp[i%3][j][l];
        rep(j,d)rep(l,k+1){
            if(dp[i%3][j][l] != -inf){
                chmax(dp[(i+1)%3][j+1][min(l+c[i+1],k)],dp[i%3][j][l] + a[i+1]);
            }
        }
    }

    if(dp[n%3][d][k] == -inf)cout << "No" << endl;
    else cout << dp[n%3][d][k] << endl;
}