package codejam;

import java.util.*;
import java.io.*;

public class RecycledNumbers {
	public static void main(String[] args) throws IOException {
		BufferedReader in = new BufferedReader(new FileReader("in.txt"));
		PrintWriter out = new PrintWriter(new File("out.txt"));
		
		int T = Integer.parseInt(in.readLine());
		for (int t = 1; t <= T; ++t) {
			String[] parts = in.readLine().split("[ ]+");
			int A = Integer.parseInt(parts[0]);
			int B = Integer.parseInt(parts[1]);
			
			int cnt = 0;
			for (int i = A; i < B; ++i) {
				String str = String.valueOf(i);
				int n = str.length();
				String res = "";
				Set<Integer> seen = new HashSet<Integer>();
				for (int j = n - 1; j > 0; --j) {
					res = str.substring(j) + str.substring(0, j);
					int k = Integer.parseInt(res);
					if (k > i && k <= B) {
						//System.out.println("(" + i + ", " + k + ")");
						if (!seen.contains(k)) {
							++cnt;
							seen.add(k);
						}
					}
				}
			}

			out.println("Case #" + t + ": " + cnt);
		}
		
		in.close();
		out.close();
		System.exit(0);
	}
}

import java.io.*;
import java.util.*;
import static java.lang.System.*;

public class C
{
	// small input version
	public static String next(String x)
	{
		return x.substring(1)+x.charAt(0);
	}
	public static void main(String[] args)
	{
		Scanner sc = new Scanner(in);
		int t = sc.nextInt();
		boolean[][] match = new boolean[1001][1001];
		for (int i = 1; i <= 1000; i++)
		{
			String str = Integer.toString(i);
			for (int j = 0; j < 4; j++)
			{
				str = next(str);
				int k = Integer.parseInt(str);
				match[Math.min(i,k)][Math.max(i,k)] = true;
			}
		}
		for (int c = 1; c <= t; c++)
		{
			int u = sc.nextInt();
			int v = sc.nextInt();
			int ctr = 0;
			for (int i = u; i <= v; i++)
			{
				for (int j = i+1; j <= v; j++)
				{
					if (match[i][j])
					{
						ctr++;
					}
				}
			}
			out.printf("Case #%d: %d\n", c, ctr);
		}
	}
}

