#include<iostream>

 #include<cstdio>

 #include<cstring>

 #include<algorithm>

 #include<cstdlib>

 #include<cmath>

 #define lson l, m, rt<<1

 #define rson m+1, r, rt<<1|1

 #define IO ios::sync_with_stdio(false);cin.tie(0);

 #define INF 1e9

 typedef long long ll;

 using namespace std;

 int n, m, a[];

 int main()

 {

     IO;

     cin >> n;

     int kase=;

     while(n--){

         cin >> m;

         for(int i = ; i < m; i++){

             cin >> a[i];

         }

         int sum = , maxm = -INF;

         int from = ;

         int ans1 = , ans2 = -;

         for(int i = ; i < m; i++){

             sum += a[i];

             if(sum < ){

                 sum = ;

                 from = i+;

             }

             else{

                 if(sum > maxm){

                     maxm = sum;

                     ans1 = from;

                     ans2 = i;

                 }

             }

         }

         cout << "Case " << ++kase << ":" << endl;

         if(ans2 == -){//sum一直小于零，每位<0

             maxm = -INF;

             for(int i = ; i < m; i++){

                 if(a[i] > maxm){

                     maxm = a[i];

                     ans1 = i; ans2 = i;

                 }

             }

             cout << maxm << " " << ans1+ << " " << ans2+ << endl;

         }

         else

             cout << maxm << " " << ans1+ << " " << ans2+ << endl;

         if(n != ) cout << endl;

     }

     return ;

 }