/**
	author:  shobonvip
	created: 2025.01.25 23:29:03
**/

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

//* ATCODER
#include<atcoder/all>
using namespace atcoder;
typedef modint998244353 mint;
//*/

/* BOOST MULTIPRECISION
#include<boost/multiprecision/cpp_int.hpp>
using namespace boost::multiprecision;
//*/

typedef long long ll;

#define rep(i, s, n) for (int i = (int)(s); i < (int)(n); i++)
#define rrep(i, s, n) for (int i = (int)(n)-1; i >= (int)(s); i--)
#define all(v) v.begin(), v.end()

template <typename T> bool chmin(T &a, const T &b) {
	if (a <= b) return false;
	a = b;
	return true;
}

template <typename T> bool chmax(T &a, const T &b) {
	if (a >= b) return false;
	a = b;
	return true;
}

template <typename T> T max(vector<T> &a){
	assert(!a.empty());
	T ret = a[0];
	for (int i=0; i<(int)a.size(); i++) chmax(ret, a[i]);
	return ret;
}

template <typename T> T min(vector<T> &a){
	assert(!a.empty());
	T ret = a[0];
	for (int i=0; i<(int)a.size(); i++) chmin(ret, a[i]);
	return ret;
}

template <typename T> T sum(vector<T> &a){
	T ret = 0;
	for (int i=0; i<(int)a.size(); i++) ret += a[i];
	return ret;
}

int main(){
	ios_base::sync_with_stdio(false);
	cin.tie(NULL);
	
	int n, d, k;
	cin >> n >> d >> k;
	vector dp(d+1, vector<ll>(k+1, -1e18));
	vector<ll> a(n), c(n);
	rep(i,0,n) cin >> a[i];
	rep(i,0,n) cin >> c[i];
	dp[0][0] = 0;
	rep(i,0,n) {
		vector ndp = dp;
		rep(j,0,d) {
			rep(x,0,k+1){
				chmax(ndp[j+1][min(x+c[i],(ll)k)], dp[j][x] + a[i]);
			}
		}
		swap(ndp, dp);
	}
	if (dp[d][k] < -1e17) {
		cout << "No\n";
	}else{
		cout << dp[d][k] << '\n';
	}
}