1 #include<iostream>
 2 #include<algorithm>
 3 #include<cstdio>
 4 #include<string.h>
 5 using namespace std;
 6 const int MAX = 10010;
 7 int dp[MAX],a;
 8 int main()
 9 {
10     int T,i,j,n,left,right,maxn,flag,num;
11     scanf("%d",&T);
12     for(j=1;j<=T;j++)
13     {
14         scanf("%d",&n);
15         maxn=-9999;
16         num=0;
17         left=right=flag=1;
18         for(i=1;i<=n;i++)
19         {
20             scanf("%d",&a);
21             num+=a;
22             if(num>maxn)
23             {
24                 maxn=num;
25                 left=flag;
26                 right=i;
27             }
28             if(num<0)
29             {
30                 num=0;
31                 flag=i+1;
32             }
33         }
34         if(j!=1) printf("\n");
35         printf("Case %d:\n",j);
36         printf("%d %d %d\n",maxn,left,right);
37     }
38     return 0;
39 }