시간 제한메모리 제한제출정답맞힌 사람정답 비율
1 초 256 MB21150.000%

## 문제

Your boss’ life is in danger and he ordered bulletproof glass windows for his car. However, he is really skeptical if the window glass is bulletproof. He fired a shot at it from F feet away and it did not break but he is not sure if it will break when fired at a closer range. He now wants to know the minimum distance in feet from where you can fire at the glass from and it will still not break. The bulletproof glass and bullets are both costly items and he wants to minimize the total cost of testing.

The boss knows that he can fire at the glass every feet starting from F-1 feet down to 0 feet and find it out by just consuming one glass. However, by using more glasses he can save the number of bullets needed to find the distance in feet. This might result in a better budget.

## 입력

The input consists of multiple test cases. The first line of input is the number of test cases N (1≤N≤100). Each of the following N lines contains three integers F (1≤F≤1000), the furthest point from where the glass does not break, G (1≤G≤1000), the cost of glass, and B (1≤B≤100), the cost of bullet.

## 출력

For each test configuration in the input first, output “Case #n: ” where n is the test configuration number, followed by the total budget you need to conduct the testing.

## 예제 입력 1

4
100 100 1
100 10 10
100 80 10
750 90 25


## 예제 출력 1

Case #1: 200
Case #2: 110
Case #3: 290
Case #4: 625