#include<bits/stdc++.h>

using namespace std;

using ll = long long;
using ld = long double;
using ull = unsigned long long;

using pii = pair<int, int>;
using pll = pair<ll, ll>;
using pld = pair<ld, ld>;

#define fi first
#define se second
#define pb push_back
#define pf push_front
#define mp make_pair
#define ins insert
#define btpc __builtin_popcount
#define btclz __builtin_clz

#define sz(x) (int)(x.size());
#define all(x) x.begin(), x.end()
#define debug(...) " [" << #__VA_ARGS__ ": " << (__VA_ARGS__) << "] "

mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());

int d4x[4] = {1, 0, -1, 0}; int d4y[4] = {0, 1, 0, -1};
int d8x[8] = {0, 1, 1, 1, 0, -1, -1, -1};
int d8y[8] = {1, 1, 0, -1, -1, -1, 0, 1};

template<class X, class Y>
    bool minimize(X &x, const Y &y) {
        if (x > y)
        {
            x = y;
            return true;
        }
        return false;
    }
template<class X, class Y>
    bool maximize(X &x, const Y &y) {
        if (x < y)
        {
            x = y;
            return true;
        }
        return false;
    }

const int MOD = 1e9 + 7; //998244353

template<class X, class Y>
	void add(X &x, const Y &y) {
		x = (x + y);
		if(x >= MOD) x -= MOD;
	}

template<class X, class Y>
	void sub(X &x, const Y &y) {
		x = (x - y);
		if(x < 0) x += MOD;
	}

/* Author : Le Ngoc Bao Anh, 11A5, LQD High School for Gifted Student*/

const ull INF = 6e18;
const int N = 6e5 + 10;

ull a[N], b[N], d[N], p[N], dp[N];
int q[N];

void solve() {
	int n, r; ull k;
	cin >> n >> r >> k;

	for(int i = 1; i <= n; i++) {
		cin >> a[i];
		int lo = max(1, i - r);
		int hi = min(n, i + r);
		dp[lo] += a[i];
		dp[hi + 1] -= a[i];
	}

	for(int i = 1; i <= n; i++) dp[i] = dp[i - 1] + dp[i];
	for(int i = 1; i <= n; i++) {
		cin >> b[i];
		b[i] = b[i] - a[i];
	}

	auto ok = [&](ull v) -> bool {
		int cnt = 0;
		ull curr = k;
		for(int i = 1; i <= n; i++) d[i] = b[i];
		for(int i = 1; i <= r; i++) q[++cnt] = i;
		for(int i = 1; i <= n + 1; i++) p[i] = 0;

		for(int i = 1; i <= n; i++) {
			if(i + r <= n) q[++cnt] = i + r;
			p[i] = p[i] + p[i - 1];

			while(curr > 0 && cnt > 0 && dp[i] + p[i] < v) {
				int id = q[cnt];
				if(d[id] == 0) {
					--cnt;
					continue;
				}

				if(id >= i) {
					ull sb = min(d[id], v - dp[i] - p[i]);
					sb = min(sb, curr);
					d[id] -= sb;
					curr -= sb;
					p[i] += sb;
					p[min(n, id + r) + 1] -= sb;
				} else {
					if(id + r < i) break;
					ull sb = min(d[id], v - dp[i] - p[i]);
					sb = min(sb, curr);
					d[id] -= sb;
					curr -= sb;
					p[i] += sb;
					p[min(n, id + r) + 1] -= sb;
				}
			}

			if(dp[i] + p[i] < v) return false;
		}

		return true;
	};

	ull L = 0, R = INF, ans = 0;
	while(L <= R) {
		ull mid = (L + R) >> 1;
		if(ok(mid)) {
			ans = mid;
			L = mid + 1;
		} else R = mid - 1;
	}

	cout << ans;
}

int main()
{
    ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
    #ifndef ONLINE_JUDGE
    freopen("input.txt", "r", stdin);
    freopen("output.txt", "w", stdout);
    #else
    //online
    #endif

    int tc = 1, ddd = 0;
    // cin >> tc;
    while(tc--) {
        //ddd++;
        //cout << "Case #" << ddd << ": ";
        solve();
    }
}