#include<map>
#include<set>
#include<stack>
#include<cmath>
#include<queue>
#include<string>
#include<cstring>
#include<iostream>
#include<algorithm>
#include<unordered_map>
using namespace std;
/*====================*/
#define DEBUGX
#define endl "\n"
/*====================*/
typedef long long lnt;
/*====================*/
const int N = 1e6 + 10;
const int M = 1e6 + 10;
/*====================*/
const lnt MOD = 998244353;
const lnt INF = 0X3F3F3F3F;
/*====================*/
const int dx[] = { -1,1,0,0,-1,-1,+1,+1 };
const int dy[] = { 0,0,-1,1,-1,+1,-1,+1 };
/*====================*/

/*====================*/
void Solve(void)
{
	lnt l, r;
	int test = 0;
	while (cin >> l >> r)
	{
		int ans = 0;
		for (lnt a = l; a <= min(r, 1000ll); ++a)
		{
			for (lnt b = l; b <= min(r, 1000ll); ++b)
			{
				if ((a * a * a + b * b * b) % 10 == 3)
				{
					lnt c = (a * a * a + b * b * b) / 10;
					if (l <= c && c <= r)
					{
						ans++;
					}
				}
			}
		}
		cout << "Case " << ++test << ": " << ans << endl;
	}
}
/*====================*/
int main()
{
	ios::sync_with_stdio(false);
	cin.tie(NULL), cout.tie(NULL);
#ifndef ONLINE_JUDGE
	freopen("C:\\Users\\ProtectEMmm\\Desktop\\IN.txt", "r+", stdin);
#endif
	int T = 1; //cin >> T;
	while (T--)Solve();
	return 0;
}