Problem Statement:

In an ICPC national contest after the operations team had arrived to the site, they discovered that a mistake had been made in connecting the network of computers that the contestants will use, and many unneeded cables has been installed between the computers. So Abdelrahman Mostafa (the regional director of operations in the ACPC) wants to remove as much as he can of the cables to minimize the possibility of a runner tripping on a cable, and all the computers should be able to reach each other after removing these cables (they are all initially reachable from each other), can you help him?

A computer is reachable from another computer if there is a direct cable between them, or if both are reachable from another third computer.

Input Format:

Your program will be tested on one or more test cases. The first line of the input will be a single integer T, the number of test cases (1 ≤ T ≤ 100). Followed by T lines, each line is a test case which consists of two integers separated by a single space N and M (1 ≤ N ≤ 10^{4}) and (N - 1 ≤ M ≤ 10^{5}) denoting the number of computers and the number of cables in the contest hall, respectively.

Output Format:

For each test case print a single line containing "Case n:" (without the quotes) where n is the test case number (starting from 1) followed by a space then R which is the maximum number of cables that can be removed.

Sample Input:

1
4 5

Sample Output:

Case 1: 2