HDU 3415

#include<iostream>
using namespace std;

int sum[200001];
int a[100001];
int que[200001];

int run(int head,int tail,int m)
{
	int st=head+1;
	int en=tail;
	while(st<en)
	{
		int min=(st+en)/2;
		if(sum[que[min]]>m)
		{
			en=min;
		}
		else
		{
			st=min+1;
		}
	}
	return st;
}

int main()
{
	int t,n,k,i,head,tail,Max,st,en,stt;
	scanf("%d",&t);
	while(t--)
	{
		scanf("%d%d",&n,&k);
		sum[0]=0;
		for(i=1;i<=n;i++)
		{
			scanf("%d",&a[i]);
			sum[i]=sum[i-1]+a[i];
		}
		for(i=n+1;i<=n+k;i++)
		{
			sum[i]=sum[i-1]+a[i-n];
		}
		head=0,tail=0;
		Max=-99999999;
		for(i=1;i<=n+k;i++)
		{
			if(head<tail&&(sum[que[tail]]>=sum[i-1]))
			{
				stt=run(head,tail,sum[i-1]);
				que[stt]=i-1;
				tail=stt;
			} 
			else
			{
				que[++tail]=i-1;
			}
			while(head<tail&&(i-que[head+1])>k) head++;
			if(Max<(sum[i]-sum[que[head+1]]))
			{
				Max=sum[i]-sum[que[head+1]];
				st=que[head+1]+1;
				en=i;
			}
		}
		if(st!=n)
		{
			st%=n;
		}
		if(en!=n)
		{
			en%=n;
		}
		printf("%d %d %d\n",Max,st,en);
	}
	return 0;
}