#include <iostream>
using namespace std;
#include <vector>
#define vi vector<int>
#define ll long long
#include <algorithm>
#include <set>
#include <string>
#include <bitset>
#include <cmath>
#include <math.h>
#define pll pair<ll,ll>
#define vll vector<ll>
#define pi pair<int,int>
#include <map>
#include <queue>
#define x first
#define y second
#define pd pair<double,double>

const int siz = 3e5;
ll c[siz];
ll s[siz];

int n,k;
multiset<int>::iterator kth;
ll sum = 0;
multiset<int> mul;
ll ans = -1e18;
ll cost = 0;
void er(ll i) {
	cost -= c[i];
	ll val = s[i];
	if (mul.size() <= k+1) {
		mul.erase(mul.find(val));
		sum -= val;
		kth = mul.begin();
	}
	else {
		auto it = mul.find(val);
		if (val < *kth || (val == *kth && it != kth)) {
			mul.erase(it);
			return;
		}
		else {
			kth--;
			sum += *kth - val;
			mul.erase(it);
			return;
		}

	}
}
void in(ll i) {
	ll val = s[i];
	cost += c[i];
	if (mul.size() < k) {
		mul.insert(val);
		sum += val;
		kth = mul.begin();
	}
	else {
		mul.insert(val);
		if (*kth >= val)return;
		sum += val - *kth;
		kth++;
	}
}
void rec(int l, int r, int a, int b) {
	if (l > r)return;
	int mid = (l + r) / 2;
	b = min(mid , b);
	pll opt={-1e18,a};
	for (int i = a; i <= b; i++) {
		if (mid - i + 1 >= k) {
			opt = max(opt, { sum - cost,i });
		}
		er(i);
	}
	ans = max(ans, opt.x);
	if (l == r)return;

	for (int i = mid; i > max(b,(l+mid-1)/2); i--)er(i);
	for (int i = a; i <=min(b, (l + mid-1) / 2);i++)in(i);
	rec(l, mid - 1, a, opt.y);
	for (int i = mid; i > max(b, (l + mid - 1) / 2); i--)in(i);
	for (int i = a; i <= min(b, (l + mid - 1) / 2); i++)er(i);

	for (int i = mid+1; i <= (r+ mid+1) / 2; i++)in(i);
	for (int i = opt.y; i <=b; i++)in(i);
	rec(mid+1, r, opt.y, b);
	for (int i = mid + 1; i <= (r + mid + 1) / 2; i++)er(i);
	for (int i = opt.y; i <= b; i++)er(i);

	for (int i = a; i <= b; i++) {
		if (mid - i + 1 >= k) {
			opt = max(opt, { sum - cost,i });
		}
		in(i);
	}
}

int main()
{
	ios_base::sync_with_stdio(false); cin.tie(NULL);
	cin >> n >> k;
	for (int i = 0; i < n; i++)cin >> c[i];
	for (int i = 0; i < n; i++)cin >> s[i];

	for (int i = 0; i < n; i++) {
		for (int j = i; j < n; j++) {
			in(j);
			if (j - i + 1 >= k)ans = max(ans, sum - cost);
		}
		for (int j = i; j < n; j++) {
			er(j);
		}
	}
	cout << ans;
	//for (int i = 0; i <= (n-1)/2; i++)in(s[i]);
	//rec(0, n - 1, 0, n - 1);
}

// Run program: Ctrl + F5 or Debug > Start Without Debugging menu
// Debug program: F5 or Debug > Start Debugging menu

// Tips for Getting Started: 
//   1. Use the Solution Explorer window to add/manage files
//   2. Use the Team Explorer window to connect to source control
//   3. Use the Output window to see build output and other messages
//   4. Use the Error List window to view errors
//   5. Go to Project > Add New Item to create new code files, or Project > Add Existing Item to add existing code files to the project
//   6. In the future, to open this project again, go to File > Open > Project and select the .sln file