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

}
package codejam;
import java.util.Scanner;
import java.util.StringTokenizer;
public class Codejam {
    static final Scanner keyboard = new Scanner(System.in);
    public static void main(String[] args) {
    int casos = Integer.parseInt(keyboard.nextLine());
        for(int x=1; x<=casos;x++)
        {
           String a, b;
           String A[]=new String[1000];
           String linea;
           linea = keyboard.nextLine();
            	StringTokenizer tokens= new StringTokenizer(linea," ");
		a = tokens.nextToken();
                b = tokens.nextToken();
           int counter=0;
           for (int i=Integer.parseInt(a); i<Integer.parseInt(b); i++)
                {
                    String c = "" +i;
                    char[] achar = c.toCharArray();
                    if (achar.length==2)
                    {
                        int one=Integer.parseInt("" +achar[1])*10+Integer.parseInt("" +achar[0]); 
                        if (one<=Integer.parseInt(b)&&one>i)
                        counter+=1;
                    }
                     if (achar.length==3)
                    {
                        int one= Integer.parseInt("" +achar[2])*100+Integer.parseInt("" +achar[0])*10+Integer.parseInt("" +achar[1]); 
                        if (one<=Integer.parseInt(b)&&one>i)
                        counter+=1;
                        int two= Integer.parseInt("" +achar[1])*100+Integer.parseInt("" +achar[2])*10+Integer.parseInt("" +achar[0]); 
                        if (two<=Integer.parseInt(b)&&two>i)
                        counter+=1;
                    }
                }
           System.out.println("Case #" +x +": " +counter);
        }     
    }
}
