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

class B
{
	public static void main(String[] args) 
	{
		try
		{
			BufferedReader br = new BufferedReader(new FileReader("B.in"));
			PrintWriter pw = new PrintWriter(new FileWriter("B.out"));
			int X = Integer.parseInt(br.readLine());

			for(int i=0; i<X; i++)
			{
				String[] S = br.readLine().split(" ");
				int A = Integer.parseInt(S[0]);
				int B = Integer.parseInt(S[1]);
				int R = 0;

				int x = 1;
				int n = 0;
				while(A/x > 0) {
					n++;
					x *= 10;
				}

				for(int j=A; j<B; j++) {
					Set<Integer> seen = new HashSet<Integer>();
					for(int k=1; k<n; k++) {
						int p1 = j % (int)Math.pow(10, k);
						int p2 = (int) Math.pow(10, n-k);
						int p3 = j / (int)Math.pow(10, k);
						int y = p1*p2 + p3;
						
						if(j < y && !seen.contains(y) && y <= B) {
							seen.add(y);
							R++;
						}
					}
				}

				pw.printf("Case #%d: %d\n", i+1, R);
				pw.flush();
			}
		}
		catch(Exception e)
		{ 
			e.printStackTrace();
		}
	}
}

import java.util.HashSet;
import java.util.Scanner;


class ProblemCSmall {
	// Not happy that my previous approaches didn't work and that I have to do it this way, but whatever works...
	public static void main(String[] args) {
		Scanner in = new Scanner(System.in);
		
		int T = in.nextInt(), I = 0;
		while (T --> 0) {
			int A = in.nextInt(), B = in.nextInt();
			int lenA = (int) Math.log10(A), lenB = (int) Math.log10(B);
			int prevStart = A;
			HashSet<String> pairs = new HashSet<String>();
			for (int i = lenA; i <= lenB; ++i) {
				int currPow10 = (int) Math.pow(10, i);
				int start = (int) Math.max(prevStart, currPow10), end = (int) Math.min(B, 10*currPow10-1);
				for (int j = start; j <= end; ++j) {
					int k = j;
					for (int l = 0; l < i; ++l) {
						k = (k % currPow10) * 10 + (k / currPow10);
						if (k >= start && k <= end && k != j) {
							pairs.add(String.format("%07d%07d", Math.min(j, k), Math.max(j, k)));
						}
					}
				}
				prevStart = end + 1;
			}
			System.out.printf("Case #%d: %d\n", ++I, pairs.size());
		}
	}

}
