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.File;
import java.io.FileWriter;
import java.io.IOException;
import java.util.Scanner;

/*
 * To change this template, choose Tools | Templates
 * and open the template in the editor.
 */

/**
 *
 * @author utp
 */
public class C {
    public static void main(String Args[]) throws IOException{
        Scanner sc = new Scanner (new File("input.in"));
        FileWriter fw = new FileWriter("output.out");
        int T = sc.nextInt();
        for (int k=0;k<T;k++){
            int A=sc.nextInt();
            int B = sc.nextInt();
            int count=0;
        for (int i=A;i<=B;i++){
            for (int j=i+1;j<=B;j++){
            String num1 = Integer.toString(i);
            String num2 = Integer.toString(j);
            if (j==1121){
              //  System.out.println("");
            }
             int c = calcular(num1.toCharArray(),num2.toCharArray());
             if (c>=0){
                 String sub2 = num2.substring(0, c);
                 String sub1 = num2.substring(c);
                 if (num1.equals(sub1.concat(sub2))){
                  //   System.out.println("Case #"+(k+1)+": "+sub1+" "+sub2+" "+num1+" "+num2);
                     count++;
                 }
             }
            }
            }
        fw.write("Case #"+(k+1)+": "+count+"\n");
        }
        fw.close();
    }
    
    public static int calcular(char cad1[], char cad2[]){
        for (int j=0;j<=cad1.length;j++){
            String temp1 = String.copyValueOf(cad1, j,cad1.length-j);
            String tmp2 = String.copyValueOf(cad2);
            if (tmp2.contains(temp1)){
                return temp1.length();
            }
            
        }
        return -1;
    }
}
