
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.*;
import java.util.*;
// read file name frome command line
public class ProblemC{
	public static void main(String args[]){
	
		
		try{
			// reading file initialization
			String 			filename = args[0];
			FileReader 		frStream = new FileReader(		filename);
			BufferedReader 	brStream = new BufferedReader(	frStream);
			// writing file initializtion
			FileWriter     fwStream = new FileWriter(		filename.substring(0, filename.length()-3)+"Output.in" );
			BufferedWriter bwStream = new BufferedWriter( 	fwStream  );
			PrintWriter    pwStream = new PrintWriter(    	bwStream  );
			
			String text = brStream.readLine();
			int numCase =  Integer.parseInt( text );


                        for( int i = 0 ; i < numCase ; i++){
                            text = brStream.readLine();
                            StringTokenizer currLine = new StringTokenizer( text );
                            int min = Integer.parseInt(currLine.nextToken());
                            int max = Integer.parseInt(currLine.nextToken());
                            int counter = 0;
                            for( int j = min ; j < max ; j++){
                                String number =""+j;
                                int count=0;
                                for( int k = 1 ;k < number.length(); k++){
                                    String pairnumber=number.substring(k)+number.substring(0,k);
                                    int pair=Integer.parseInt(pairnumber);
                                    if(pair > j  && pair <= max ){
                                        count++;

                                        counter++;
                                        if(i==3 && count > 1)
                                            System.out.println(counter+" "+j+" "+pair);
                                        continue;
                                    }
                                }
                            }
                           pwStream.println ("Case #" + (i+1) + ": " +counter);
                    }
			// close all I/O files
			brStream.close();
			pwStream.close();
			
		}
		catch(IOException e){}
	}
}