
import java.util.Scanner;
import java.util.Set;
import java.util.TreeSet;
import java.io.File;
import java.io.IOException;
import java.io.FileWriter;
import java.io.BufferedWriter;

public class Recycle
{
	public static void main(String[] args)
	{
/*		Set<Integer> perms = getPermutations(123456);
		
		for(Integer i: perms)
			System.out.println(i);*/
	
		try
		{
			Scanner s = new Scanner(new File("recycle.in"));
			BufferedWriter w = new BufferedWriter(new FileWriter(new File("recycle.out")));
			int numCases = s.nextInt();
			s.nextLine();
			
			for(int n = 1;n <= numCases; n++)
			{
				int A = s.nextInt();
				int B = s.nextInt();
				int count = 0;
				for(int k = A; k <= B; k++)
				{
					count += getNumPairs(k, B);
				}
				
				w.write("Case #" + n + ": " + count + "\n");
			}
			
			w.flush();
			w.close();
		}
		catch (IOException e)
		{
			e.printStackTrace();
		}
	}
	
	public static int getNumPairs(int n, int B)
	{
		Set<Integer> possibles = getPermutations(n);
		int count = 0;
		for(Integer i : possibles)
			if(i > n && i <= B)
				count++;
		return count;
	}
	
	public static Set<Integer> getPermutations(int n)
	{
		Set<Integer> perms = new TreeSet<Integer>();
		char[] digits = String.valueOf(n).toCharArray();
		
		for(int firstPos = 1; firstPos < digits.length; firstPos++)
		{
			String toBuild = "";
			for(int k = 0; k < digits.length; k++)
				toBuild += digits[(firstPos + k) % digits.length];
			perms.add(Integer.parseInt(toBuild));
		}
		return perms;
	}
	

}
import java.util.HashSet;
import java.util.Scanner;
import java.util.Set;

/**
 * Google Code Jam 2012
 * 
 * @author 7henick
 */
public class ProblemC {

    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int T = sc.nextInt();
        sc.nextLine();

        // A <= n < m <= B
        for (int i = 0; i < T; i++) {
            int A = sc.nextInt();
            int B = sc.nextInt();

            int count = 0;

            for (int n = A; n < B; n++) {
                String nString = String.valueOf(n);
                Set<Integer> intSet = new HashSet<Integer>();

                for (int j = 1; j < nString.length(); j++) {
                    char idx = nString.charAt(j);

                    if (idx != '0') {
                        String mString = nString.substring(j)
                                + nString.substring(0, j);
                        int m = Integer.valueOf(mString);

                        if (n < m && m <= B) {
                            intSet.add(m);
                        }
                    }
                }
                count += intSet.size();
            }

            System.out.println("Case #" + (i + 1) + ": " + count);
            if (sc.hasNextLine()) {
                sc.nextLine();
            }
        }
    }

    public static boolean isValid(int n, int m, int B) {
        return n < m && m <= B;
    }
}
