import java.io.BufferedReader;
import java.io.InputStreamReader;
import java.util.StringTokenizer;

class RecycledNumbers{
	
	
	
	int getcount(int small,int large){
		int count = 0;
		for(int currnum = small; currnum < large; currnum++){
			int permut = currnum;
			int no_of_digits = 0;
			while(permut > 0){
				permut = permut/10;
				no_of_digits++;
			}
			int lastDigit = currnum % 10;
			permut = currnum / 10;
			permut = permut + lastDigit * (int)Math.pow(10, no_of_digits-1);
			while(permut != currnum){
				
				if(permut >= currnum && permut <= large){
					
					count++;
				}
				lastDigit = permut % 10;
				permut = permut / 10;
				permut = permut + lastDigit * (int)Math.pow(10, no_of_digits-1);
				
			}
			
		}
		
		return count;
	}
	
	public static void main(String args[]){
		RecycledNumbers d = new RecycledNumbers();
		
		int no_of_cases = 0;
		String input = "";
		
		BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
		try{
			no_of_cases = Integer.parseInt(br.readLine());
		}
		catch(Exception e){
			System.out.println("First line is not a number");
		}
		
		for(int i=1; i <= no_of_cases;i++){
			try{
				input = br.readLine();
			}
			catch(Exception e){
				System.out.println("Number of test cases different from the number mentioned in first line");
			}
			
			System.out.print("Case #" +i+": ");
			
			StringTokenizer t =  new StringTokenizer(input);
			int small=0,large=0;
			if(t.hasMoreTokens()){
				small = Integer.parseInt(t.nextToken());
			}
			if(t.hasMoreTokens()){
				large = Integer.parseInt(t.nextToken());
			}
			System.out.println(d.getcount(small,large));
			
		}
		
		
		

	}
	
	
}
import java.io.FileNotFoundException;
import java.io.FileReader;
import java.io.IOException;
import java.io.PrintStream;
import java.util.Arrays;
import java.util.Scanner;

public class B {

    public static void main(String[] args) throws FileNotFoundException, IOException {
        try (FileReader file = new FileReader("entrada.in"); Scanner scanner = new Scanner(file)) {
            int T,A,B,i,j,k=0,total=0; 
            String xs;
            T=scanner.nextInt();
            boolean matriz[][] = new boolean[1000][];
            for (i=0;i<1000;i++)
                matriz[i] = new boolean[1000];
            System.setOut(new PrintStream("salida.out"));
            for (i=1;i<=T;i++){
                for (j=0;j<1000;j++)
                    Arrays.fill(matriz[j], false);
                A=scanner.nextInt();
                B=scanner.nextInt();
                for (j=A;j<=B;j++){
                     xs=Integer.toString(j);
                     if (xs.length()==2 && xs.charAt(1)!='0'){
                         k=Integer.parseInt(xs.charAt(1)+""+xs.charAt(0));
                         if (j!=k && k<=B && k>=A)
                            matriz[j][k]=true;
                     }
                     if (xs.length()==3 && xs.charAt(2)!='0'){
                         k=Integer.parseInt(xs.charAt(2)+""+xs.charAt(0)+""+xs.charAt(1));
                         if (j!=k && k<=B && k>=A)
                            matriz[j][k]=true;
                     }
                     if (xs.length()==3 && xs.charAt(1)!='0'){
                         k=Integer.parseInt(xs.charAt(1)+""+xs.charAt(2)+""+xs.charAt(0));
                         if (j!=k && k<=B && k>=A)
                            matriz[j][k]=true;
                     }
                }
                total=conteomatriz(matriz);
                System.out.println("Case #"+i+": "+total);
            }
        }
        
    }
    public static int conteomatriz(boolean[][] m){
        int total=0,i,j;
        for (i=0;i<1000;i++){
            for (j=0;j<1000;j++){
                if (m[i][j]){
                    m[j][i]=false;
                    //System.out.println(i+" "+j);
                    total++;
                }
            }
        }
        return total;
    }
    
}
