`
include[HTML_REMOVED]
using namespace std;
int main() {
int n, k;
cin >> n >> k;
vector[HTML_REMOVED] vec(n, 0);
vector[HTML_REMOVED] valid(n, 0);
vector[HTML_REMOVED] head(n, 0);
vector[HTML_REMOVED] tail(n, 0);
long long int temp = 0;
for (int i = 0; i < n; i) cin >> vec[i];
for (int i = 0; i < n; i) {
cin >> valid[i];
if (valid[i] == 1) temp += vec[i];
}
if (valid[0] == 1) head[0] = vec[0];
long long int res = 0, sum = 0;
int left = 0, right = k;
for (int i = 0; i < k; i) {
if (valid[i] == 0) sum+=vec[i];
}
while (right<n) {
res = max(res, sum);
if (valid[right] == 0) sum += vec[right];
if (valid[left] == 0) sum -= vec[left];
left; right++;
}
res = max(res, sum);
cout << res+temp << endl;
return 0;
}`