#include<stdio.h>
main()
{
    int n, i, a[100002], b, j, s, m, k;
    long max, sum;
    while ( scanf ( "%d", &n ) != EOF )
    {
        for ( j = 1; j <= n; j++ )
        {
            scanf ( "%d", &m );
            for ( i = 0; i < m; i++ )
                scanf ( "%d", &a[i] );
            sum = 0;
            b = 1;
            max = -1001;
            for ( i = 0; i < m; i++ )
            {
                sum += a[i];
                if ( sum > max )
                {
                    max = sum;
                    k = b;
                    s = i + 1;
                }
                if ( sum < 0 )
                {
                    sum = 0;
                    b = i + 2;
                }
            }
            if ( j != n )
                printf ( "Case %d:\n%ld %d %d\n\n", j, max, k, s );
            else
                printf ( "Case %d:\n%ld %d %d\n", j, max, k, s );
        }
    }
}