#SDNU1254. Problem B. SOS

Problem B. SOS

Description

Lulichuan is a good captain, He is thinking every day how to make his team stronger,However, his team members always disappointed him.They always make mistakes, like WA,TLE,MLE,CE,PE.....WA, TLE, MLE, CE,PE.....Today, he thought of a good way to make team members stronger. That is to make the peoblem simpler. So he got a easy problem, now, we have three numbers, a,b,c,a, b, c,

We know gcd(a,c)=bgcd(a,c) = b, but, we lose the cc, we only know a,b,b!=ca, b, b != c,we want to know the smallest cc.

(0<a,b,c<10000000)(0 < a, b, c< 10000000)

Format

Input

T(0<T<=10000)T T(0 < T <= 10000) T is TestCase

a,b(0<a,b<=10000000)a, b(0 < a, b<=10000000)

Output

Case #TestCase: answer

Samples

2
6 2
12 4
Case #1: 4
Case #2: 8