Problem J

Fermat's Last Theorem: no three positive integers a, b, and c can satisfy the equation aⁿ + bⁿ = cⁿ for any integer value of n greater than two.

From the theorem, we know that a³ + b³ = c³ has no positive integer solution.

However, we can make a joke: find solutions of a³ + b³ = c3. For example 4³ + 9³ = 793, so a=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<=10⁸).

Output

For each test case, print the number of solutions.

Sample Input

1 10
1 20
123 456789

Output for the Sample Input

Case 1: 0
Case 2: 2
Case 3: 16