Max Sum

Time Limit: / MS (Java/Others)    Memory Limit: / K (Java/Others)

Total Submission(s):     Accepted Submission(s): 

Problem Description

Given a sequence a[],a[],a[]......a[n], your job is to calculate the max sum of a sub-sequence. For example, given (,-,,,-), the max sum in this sequence is  + (-) +  +  = .

Input

The first line of the input contains an integer T(<=T<=) which means the number of test cases. Then T lines follow, each line starts with a number N(<=N<=), then N integers followed(all the integers are between - and ).

Output

For each test case, you should output two lines. The first line is "Case #:", # means the number of the test case. The second line contains three integers, the Max Sum in the sequence, the start position of the sub-sequence, the end position of the sub-sequence. If there are more than one result, output the first one. Output a blank line between two cases.

Sample Input

  -   -

   -  -  -

Sample Output

Case :

Case :

Author

Ignatius.L