
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.*;

/**
 *
 * @author Jhon
 */
public class Main {

    /**
     * @param args the command line arguments
     */
    public static void main(String[] args) {
        Scanner cin = new Scanner(System.in);

        List<Integer> integers = new ArrayList<>();
        int a = Integer.parseInt(cin.nextLine());
        int[] begin = new int[a];
        int[] end = new int[a];

        int value, value2, count;
        boolean aux;
        String number;
        for (int i = 0; i < a; i++) {
            integers.clear();
            count = 0;
            begin[i] = cin.nextInt();
            end[i] = cin.nextInt();
            for (int j = begin[i]; j <= end[i]; j++) {



                if (j >= 10) {
                    if (j < 100) {
                        number = j + "";
                        value = Integer.parseInt(number.charAt(1) + "" + number.charAt(0));
                        aux = true;
                        for (Integer ii : integers) {
                            if (ii.intValue() == value) {
                                aux = false;
                                break;
                            }
                        }
                        if (aux && value != j && number.charAt(1) != '0' && begin[i] <= value && value <= end[i]) {
                            integers.add(j);
                            count++;
                        }
                    } else if (j <= 1000) {
                        number = j + "";
                        value = Integer.parseInt(number.charAt(2) + "" + number.charAt(0) + "" + number.charAt(1));
                        value2 = Integer.parseInt(number.charAt(1) + "" + number.charAt(2) + "" + number.charAt(0));
                        aux = true;
                        for (Integer ii : integers) {
                            if (ii.intValue() == value) {
                                aux = false;
                                break;
                            }
                        }
                            
                        if (aux && value != j && 100 <= value && begin[i] <= value && value <= end[i]) {
                            integers.add(j);
                           count++;
                        }
                          
                        aux = true;
                        for (Integer ii : integers) {
                            if (ii.intValue() == value2) {
                                aux = false;
                                break;
                            }
                        }
                        if (aux && value2 != j && 100 <= value2 && begin[i] <= value2 && value2 <= end[i]) {
                            integers.add(j);
                            count++;
                        }
                    }

                }
            }


            System.out.println("Case #"+(i+1)+":"+count);
        }




    }
}