#include <cstdio>
using namespace std;
int n, k, a[100009], b[100009], maxim,maxi, c,x ,y;
inline int Max(int x, int y)
{
   return (x > y)? x : y;
}
int main()
{
    freopen("secv2.in","r",stdin);
    freopen("secv2.out","w",stdout);
    scanf("%d",&n);
    scanf("%d",&k);
    for(int i=1;i<=n;i++)
        scanf("%d",&a[i]);

    b[1]=a[1];
    for( int i = 2; i <= n; i++)
        b[i] =  b[i-1] + a[i];

    x=1; y=n; maxim=b[n];

     for(int i=1; i<=n-k;i++)
    for(int j=i+k; j<=n;j++)
    {
        c=b[j]-b[i-1];
        if(c>=maxim)
        {
            maxim=c;
            x=i;
            y=j;
        }
    }

    printf("%d %d %d",x,y,maxim);
    return 0;
}