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();
		}
	}
}

/*
 * To change this template, choose Tools | Templates
 * and open the template in the editor.
 */
package problem.c.recycled.numbers;

import java.io.File;
import java.io.IOException;
import java.io.PrintStream;
import java.util.Scanner;

/**
 *
 * @author Park
 */
public class ProblemCRecycledNumbers {

    /**
     * @param args the command line arguments
     */
    public static void main(String[] args) throws IOException {
        PrintStream out = new PrintStream(new File("/Users/Park/Desktop/output.txt"));
        Scanner in = new Scanner(new File("/Users/Park/Desktop/C-large.in"));
        int testCase = Integer.parseInt(in.next());
        for (int n = 0; n < testCase; n++) {
            int count = 0;
            //
            int start = Integer.parseInt(in.next());
            int end = Integer.parseInt(in.next());
            for (int i = start; i <= end; i++) {
                boolean chk = true;
                String num = i + "";
                int numLength = num.length();
                int[] alreadySearch = new int[numLength - 1];
                for (int j = 1; j < numLength; j++) {
                    String f = num.substring(0, j);
                    String b = num.substring(j);
                    int search = Integer.parseInt(b + f);
                    for (int k = 0; k < j - 1; k++) {
                        if (search == alreadySearch[k]) {
                            chk = false;
                            break;
                        }
                        chk = true;
                    }
                    alreadySearch[j - 1] = search;
                    if (chk && (search + "").length() == numLength && search != i && search >= start && search <= end) {
                        count++;
                    }
                }
            }
            out.println("Case #" + (n + 1) + ": " + count / 2);
            System.out.println("Case #" + (n + 1) + ": " + count / 2);
        }
        in.close();
        out.close();
    }
}
