#include <bits/stdc++.h>
//#include <atcoder/all>
using namespace std;
//using namespace atcoder;
//using mint = modint1000000007;
//const int mod = 1000000007;
//using mint = modint998244353;
//const int mod = 998244353;
//const int INF = 1e9;
const long long LINF = 1e18;
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rep2(i,l,r)for(int i=(l);i<(r);++i)
#define rrep(i, n) for (int i = (n) - 1; i >= 0; --i)
#define rrep2(i,l,r)for(int i=(r) - 1;i>=(l);--i)
#define all(x) (x).begin(),(x).end()
#define allR(x) (x).rbegin(),(x).rend()
#define P pair<int,int>
template<typename A, typename B> inline bool chmax(A & a, const B & b) { if (a < b) { a = b; return true; } return false; }
template<typename A, typename B> inline bool chmin(A & a, const B & b) { if (a > b) { a = b; return true; } return false; }

int main() {
	ios::sync_with_stdio(false);
	cin.tie(nullptr);
	int n, d, k; cin >> n >> d >> k;
	vector<int>a(n), c(n);
	rep(i, n)cin >> a[i];
	rep(i, n)cin >> c[i];
	// dp[i][j]:= 採用個数i、美しさjの満足度MAX
	vector dp(d + 1, vector<long long>(k + 1, -LINF));
	dp[0][0] = 0;
	rep(i, n) {
		vector ndp(d + 1, vector<long long>(k + 1, -LINF));
		rep(p, d + 1) rep(q, k + 1) {
			if (dp[p][q] == -LINF)continue;
			// use
			{
				int np = p + 1;
				int nq = min(k, q + c[i]);
				long long nv = dp[p][q] + a[i];
				if (np <= d && nq <= k) {
					chmax(ndp[np][nq], nv);
				}
			}
			// unuse
			chmax(ndp[p][q], dp[p][q]);
		}
		swap(dp, ndp);
	}
	long long val = dp[d][k];
	if (val == -LINF)cout << "No" << endl;
	else cout << val << endl;
	return 0;
}