//最大连续子序列和 //dp经典
#include<iostream>
using namespace std;
int main()
{
int n,m,max,a[100000],c=1;
int start,end,nowstart,nowend;
cin >> n;
while(c<=n)
{
max=0;
cin >> m;
for( int k = 0;k < m;k ++)
{
cin >> a[k];
}
max = a[0];
start=1;
end = 1;
nowstart=1;
nowend=1;
for(int i=1;i < m;i++)
{
if( a[i-1] + a[i]>=a[i])
{
a[i]=a[i-1]+a[i];
nowend=i+1;
}
else
{
nowstart=i+1;
nowend=i+1;
}
if(max < a[i])
{
max = a[i];
start = nowstart;
end = nowend;
}
}
cout << "Case " <<c<<":\n";
cout << max << " " << start <<" " << end;
cout << endl;
if( c!=n)cout << endl;
c++;
}
system("pause");
}