#include <bits/stdc++.h>
using namespace std;
long long n, k, s;
long long d[200005];
long long h[200005];
bool calc(long long x) {
	long long cnt = 0;
	for(int i = 1; i <= n; i++) {
		if(h[i] + d[i] * x >= k)
			cnt += h[i] + d[i] * x;
		if (cnt >= s)
			return true;
	}
	return false;
}
long long ans;
long long t = 1e18;
int main () {
	scanf("%lld%lld%lld", &n, &s, &k);
	for(int i = 1; i <= n; i++)
		scanf("%lld",&h[i]);
	for(int i = 1; i <= n; i++){
		scanf("%lld",&d[i]);
		t = min (t, d[i]);
	}
	long long l = 0, r = (k - 1) / t + 1;
	while (l < r) {
		long long mid = (l + r) / 2;
		if (calc(mid)) {
			r = mid;
		} else
			l = mid + 1;
	}
	printf ("%lld", l);
	return 0;
}