#include<iostream>
#include<cstring>
#include<climits>
using namespace std;
int no=INT_MIN;
int a[100001];
int b[100001];
int c[100001];
int main()
{
int t,n,max,start,end;
cin>>t;
int k=0;
while(t)
{
memset(a,0,sizeof(a));
memset(a,0,sizeof(b));
memset(a,0,sizeof(c));
cin>>n;
int i;
for(i=1;i<=n;i++)
cin>>a[i];
b[0]=-1;
for(i=1;i<=n;i++)
{
if(b[i-1]>=0)
{
b[i]=a[i]+b[i-1];
c[i]=c[i-1];
}
else
{
b[i]=a[i];
c[i]=i;
}
}
max=no;start=0;end=0;
for(i=1;i<=n;i++)
if(b[i]>max)
{
max=b[i];
start=c[i];
end=i;
}
cout<<"Case "<<++k<<":"<<endl;
cout<<max<<" "<<start<<" "<<end<<endl;
t--;
if(t)
cout<<endl;
}
return 0;
}