
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.io.BufferedReader;
import java.io.InputStreamReader;

class RN {
    private static BufferedReader br = null;
    private static int numCases;
    private static int lowerBound, upperBound;
    private static String[] input;

    public static void main(String[] args) throws Exception {
        try {
            br = new BufferedReader(new InputStreamReader(System.in));
            numCases = Integer.parseInt(br.readLine().trim());

            for(int i = 0; i < numCases; i++) {
                int numRecycled = 0;
                input = br.readLine().split(" ");
                lowerBound = Integer.parseInt(input[0]);
                upperBound = Integer.parseInt(input[1]);

                for(int j = lowerBound; j < upperBound; j++) {
                    String s = j + "";
                    for(int k = 0; k < s.length()-1; k++) {
                        String temp = s.substring(s.length()-1-k) + s.substring(0, s.length()-k-1);
                        //System.out.println("From " + s + " to " + temp + " with k = " + k);
                        int num = Integer.parseInt(temp);
                        if(num == j) continue;
                        //if(num >= lowerBound && num <= upperBound && !used[num]) {
                        if(num >= lowerBound && num <= upperBound && num > j) {
                            //System.out.println("From " + s + " to " + temp + " with k = " + k);
                            //System.out.println("\t" + j + "\t" + num);
                            numRecycled++;
                            //used[num] = true;
                            //used[j] = true;
                        }
                    }
                }

                System.out.println("Case #" + (i+1) + ": " + numRecycled);
            }
        }
        catch(Exception e) {
            e.getMessage();
            e.printStackTrace();
        }
    }
}
