#include <bits/stdc++.h>

 #define ll long long
 #define ull unsigned long long
 #define pi 3.141592654
 #define NUM 1e18
 #define Mod  1'000'000'007
 #define fixed(n) fixed<<setprecision(n)
 #define cin(v) for(auto &i:v) cin >> i ;
 #define cout(v) for(auto &i:v) cout << i  <<" ";
 #define vowel(x) (x=='e'||x=='a'||x=='i'||x=='o'||x=='u')
 #define small(x) (x>=97&&x<=122)
 #define capital(x) (x>=65&&x<=90)
 #define Tolower(s) transform(s.begin(),s.end(),s.begin(),::tolower);
 #define Toupper(s) transform(s.begin(),s.end(),s.begin(),::toupper);
 #define all(v) ((v).begin()), ((v).end())
 #define allr(v) ((v).rbegin()), ((v).rend())
 #define updmax(a,b) a=max(a,b)
 #define updmin(a,b) a=min(a,b)
 #define ceil(a,b) ((a/b)+(a%b?1:0))
 /* asc -> 1 2 3 ,des -> 3 2 1 */

 /***********************************************************************************/

 using namespace std;

 void Rofyda_Elghadban(){
  #ifndef ONLINE_JUDGE
    freopen("input.txt", "r", stdin), freopen("output.txt", "w", stdout);
   #endif
    ios_base::sync_with_stdio(false), cin.tie(nullptr), cout.tie(nullptr);
 }


 void solve(){
  int n,k;
  cin>>n>>k;
  vector<int>v(n+1),t(n+1),v2;
  for(int i=1;i<n+1;i++){
    cin>>v[i];
  }
  for(int i=1;i<n+1;i++){
    cin>>t[i];
  }
  for(int i=0;i<n+1;i++){
    if(t[i]==1){
      v2.push_back(v[i]);
    }else if(t[i]==0||i==0){
      v2.push_back(0);
    }
  }
  int prefix1[100001]{},prefix2[100001]{},pre=0;
  for(int i=1;i<n+1;i++){
    prefix1[i]=v[i]+prefix1[i-1];
  }
  for(int i=1;i<n+1;i++){
    prefix2[i]=v2[i]+prefix2[i-1];
  }
  int l=1,r=l+k-1,maxi=INT_MIN,s1=0,s=0,s2=0;
  for(int i=1;i<n+1;i++){
    s1=prefix2[l-1]-prefix2[0];
    s=prefix1[r]-prefix1[l-1];
    s2=prefix2[n]-prefix2[r-1];
    maxi=max(maxi,(s1+s+s2));
    if(r<=n){
      l++;
      r++;
      s1=0;
      s=0;
      s2=0;
    }
  }
  cout<<maxi<<"\n";
 }


 int main(){
 Rofyda_Elghadban();
 //freopen("input.txt","r",stdin);
 //freopen("output.txt","r",stdout);
  solve();


 return 0;
}