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.io.*;
import java.util.*;

/**
 *
 * @author Hilos
 */
public class ProblemC {

    public static BufferedWriter bw;
    public static BufferedReader br;

    public static void main(String[] args) {
        try {
            String filename = "C-large";
            br = new BufferedReader(new FileReader("E:\\Downloads\\" + filename + ".in"));
            bw = new BufferedWriter(new FileWriter("E:\\Downloads\\" + filename + ".out"));

            int caseCount = Integer.parseInt(br.readLine());

            for (int c = 0; c < caseCount; c++) {
                String[] lineParts = br.readLine().split(" ");

                int A = Integer.parseInt(lineParts[0]);
                int B = Integer.parseInt(lineParts[1]);


                SolveCase(c + 1, A, B);
            }


        } catch (Exception exc) {
            System.out.println(exc.toString());
        }
    }

    public static void SolveCase(int caseNumber, int A, int B) throws Exception {
        int totalRecycledPairs = 0;

        HashSet uniqueNumbers = new HashSet();
        for (int i = A; i <= B; i++) {
            String strVal = String.valueOf(i);

            if (!uniqueNumbers.contains(i)) {

                int recycles = 0;
                String nextStr = strVal;

                do {
                    nextStr = leftShift(nextStr);
                    int nextInt = Integer.parseInt(nextStr);
                    if (A <= nextInt && nextInt <= B) {
                        uniqueNumbers.add(nextInt);
                        recycles++;
                    }
                } while (!nextStr.equals(strVal));

                totalRecycledPairs += NchooseK(recycles, 2);
            }
        }

        bw.write("Case #" + caseNumber + ": " + totalRecycledPairs + "\n");
        bw.flush();
    }

    public static String leftShift(String str) {
        return str.substring(1) + str.charAt(0);
    }

    public static int NchooseK(int n, int k) {
        return factorial(n) / (factorial(k) * factorial(n - k));
    }

    public static int factorial(int i) {
        int result = 1;
        while (i > 1) {
            result *= i;
            i--;
        }
        return result;
    }
}
