#include <stdio.h>
#include <iostream>
#include <string.h>
#include <math.h>
#include <algorithm>
using namespace std;
const int N = 100005;

int a[N];
int dp[N];
int main()
{
    int tcase;
    scanf("%d",&tcase);
    int k =1;
    while(tcase--){
        int n;
        scanf("%d",&n);
        for(int i=1;i<=n;i++){
            scanf("%d",&a[i]);
        }
        int start=1,endd=1,t=1;
        int mx = dp[1] = a[1];
        for(int i=2;i<=n;i++){
            if(dp[i-1]>=0){
                dp[i] = dp[i-1]+a[i];
            }else{
                t = i;
                dp[i] = a[i];
            }
            if(dp[i]>mx){
                mx = dp[i];
                start = t;
                endd = i;
            }
        }
        printf("Case %d:\n%d %d %d\n",k++,mx,start,endd);
        if(tcase!=0) printf("\n");
    }
    return 0;
}