Description

IIUC is organizing a programming contest today and the GS of the Computer club is in action again. This year the contest is a team contest divided into two categories Senior and Junior. However, the GS wants to know how many teams of exactly three participants can be formed by considering both seniors and juniors. Team will not have any mixing of junior and senior category participants. Can you help the GS?
Input Format
The first line will contain an integer T, representing the number of the test cases. On each of the following T lines, you will take two integers X and Y as input, where X and Y represent the number of participants in the junior and senior category respectively.
Constraints
1 ≤ T ≤ 100
0 ≤ X, Y ≤ 300
Output Format
For i-th test case, you have to print the total number of teams that can be formed preceded by printing “Case i: ” without quote. For exact output format refer to the sample.
Sample Input 0

Sample Output 0

1/1