import sys

def is_palindrome(n):
    s = str(n)
	return s == s[::-1]

palindrome_list = range(1, 10)
fs_list = []

for n in range(2, 14/2 + 1):
	half_n = n / 2;
	is_even_len = (n == half_n + half_n)
	start = 10 ** (half_n - 1);
	end = 10 ** half_n;
	val = start;

	while val < end:
		val_s = str(val)
		val_s_rev = val_s[::-1]

		if is_even_len:
			palindrome = int(val_s + val_s_rev)
			palindrome_list.append(palindrome)
		else:
			for i in range(0, 10):
				palindrome = int(val_s + str(i) + val_s_rev)
				palindrome_list.append(palindrome)
		
		for i in range(len(palindrome_list)):
			palindrome_sqr = palindrome_list[i] ** 2
			
			if is_palindrome(palindrome_sqr):
				fs_list.append(palindrome_sqr)
		
		palindrome_list = []
		val += 1

case_cnt = int(sys.stdin.readline());

for t in range(1, case_cnt + 1):
	line = sys.stdin.readline();
	start, end = map(int, line.split(' '));
	fs_cnt = len([n for n in fs_list if n >= start and n <= end])
	print "Case #%d: %d" % (t, fs_cnt)