#include <iostream>
#include <algorithm>
#include <cassert>
#include <cmath>
#include <cstdint>
#include <numeric>
#include <set>
#include <unordered_set>
#include <map>
#include <vector>
#include <string>
#include <deque>
#include <queue>
#include <iomanip>

using namespace std;
using ll  = long long;
using pall = pair<ll,ll>;
using vell = vector<ll>;

template<class T, class U>
constexpr bool mini(T &var, const U &val) noexcept {
	const bool cmp = var > val;
	if(cmp) var = val;
	return cmp;
}
template<class T, class U>
constexpr bool maxi(T &var, const U &val) noexcept {
	const bool cmp = var < val;
	if(cmp) var = val;
	return cmp;
}

void solve();

int main(void) {
	cin.tie(nullptr);
	ios::sync_with_stdio(false);
	solve();
	return 0;
}

void solve() {
	ll n, d, K;
	cin >> n >> d >> K;
	vell a(n), c(n);
	for(auto &e:a) cin >> e;
	for(auto &e:c) cin >> e;
	// dp[i][j] = i個, j美しさ.
	vector<vell> dp(d + 1, vell(K + 1, -1e18));
	dp[0][0] = 0;
	for(intmax_t i=0;i<intmax_t(n);i++) {
		auto nextdp = dp;
		for(intmax_t j=0;j < d;j++) {
			for(intmax_t k=0;k <= K;k++) {
				if(dp[j][k] == -1e18) continue;
				maxi(nextdp[j + 1][min(K, k + c[i])], dp[j][k] + a[i]);
			}
		}
		dp = std::move(nextdp);
	}
	if(dp[d][K] == -1e18) {
		cout << "No";
		return;
	}
	cout << dp[d][K];
}