1 import java.util.Scanner;
 2 
 3 public class Main {
 4 
 5     public static void main(String[] args) {
 6         Scanner cin = new Scanner(System.in);
 7         int[] array = new int[100010];
 8         int[] dp = new int[100010];
 9         int t = cin.nextInt();
10         for (int count = 0; count < t; count++) {
11             
12             int n = cin.nextInt();
13             for(int i = 0;i<n;i++){
14                 array[i] = cin.nextInt();
15             }
16             
17             dp[0] = array[0];
18             
19             for(int i =1;i<n;i++){
20                 
21                 dp[i] = Math.max(dp[i-1]+array[i], array[i]);
22             }
23             
24             int max = dp[0];
25             
26             int endIndex = 0;
27             
28             for(int i = 1;i<n;i++){
29                 if(dp[i]>max){
30                     max = dp[i];
31                     endIndex = i;
32                 }
33             }
34             
35             
36             int temp =0,l = endIndex;
37             
38             for(int i = endIndex;i>=0;i--){
39                 temp+=array[i];
40                 if(temp==max){
41                     l = i;
42                 }
43             }
44             
45             if(count!=0){
46                 System.out.println();
47             }
48             System.out.println("Case "+(count+1)+":");
49             System.out.println(max+" "+(l+1)+" "+(endIndex+1));
50         }
51     }
52 
53 }