#include<iostream>#include<algorithm>#include<cstring>#include<cstdio>
using namespace std;
const int MAXN=100100;
int a[MAXN],q[MAXN];
long long sum[MAXN],s[MAXN];
int main()
{
int n,m;
memset(sum,0,sizeof(sum));
scanf("%d%d",&n,&m);
int i;
for (i=1;i<=n;i++)
{
scanf("%d",&a[i]);
sum[i]=sum[i-1]+a[i];
}
int head=1,tail=1;
long long ans=a[1];
q[1]=0;
for (i=1;i<=n;i++)
{
while (q[head]<=i-m-1) head++;
s[i]=sum[i]-sum[q[head]];
tail++;
while ((sum[q[tail-1]]>=sum[i])&&(tail>head)) tail--;
q[tail]=i;
if (s[i]>ans) ans=s[i];
}
printf("%lld",ans);
}