#Description
给一巧克力,问你一片一片分开和用刀切分别要做多少步?
#Algorithm
一片一片就是NMK-1
然后用刀切每次可以至少减少一半,那也就是二进制的位数
python的bin()函数可以将int转化为二进制的str不过有0b所以len要减2
#Code
def binlen(x):
if x:
return len(bin(x)) - 2
return 0
def solve():
n, m, k = map(int, input().split())
ans1 = n * m * k - 1
n, m, k = n - 1, m - 1, k - 1
ans2 = sum(map(binlen, [n, m, k]))
return ans1, ans2
t = int(input())
for i in range(1, t+1):
ans1, ans2 = solve()
print("Case #{}: {} {}".format(i, ans1, ans2))