Several sacks of rice need to be transported to five Orphanage Houses. The heaviest sack will go to the Orphanage House Al-Ameen because it has the most orphans. The lightest will be sent to Orphanage House Mutiara due to the small number of children staying there.
Given a row of rice sacks, determine which sack goes to Al-Ameen.
The first line contains an integer that represents the number of cases. The following lines each contain integers indicating the weights of rice sacks, each separated by a blank. No sack will have a weight of more than units.
For each test case, output a line in the format Case #: followed by an integer that indicates the weight of the rice sack that will go to Al-Ameen, where is the case number (starting from ).
Example 1