Fermat’s Last Theorem: no three positive integers a, b, and c can satisfy the equation an + bn = cn for any integer value of n greater than two. From the theorem, we know that a3 + b3 = c3 has no positive integer solution. However,wecanmakeajoke: findsolutionsofa3+b3 =c3. Forexample43+93 =793,soa=4, b = 9, c = 79 is a solution. Given two integers x and y, find the number of solutions where x ≤ a, b, c ≤ y. Input There will be at most 10 test cases. Each test case contains a single line: x, y (1 ≤ x ≤ y ≤ 108). Output For each test case, print the number of solutions. Sample Input 1 10 1 20 123 456789 Sample Output Case 1: 0 Case 2: 2 Case 3: 16