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

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

import java.util.Scanner;
import sun.tools.jar.resources.jar;

/**
 *
 * @author khalid
 */
public class CodeJamProblem2 {

    /**
     * @param args the command line arguments
     */
    public static void main(String[] args) {
        // TODO code application logic here
        CodeJamProblem2 jam=new CodeJamProblem2();
        jam.solve();
      
    }
    
    public void solve() {
          
         Scanner in=new Scanner(System.in);
        int count=in.nextInt();
        in.nextLine();
        String res="";
        int numOfRe;
        for(int i=1;i<=count;i++)
        {
            numOfRe=numOfRecycled(in.nextInt(),in.nextInt());
            res+="Case #"+i+": "+numOfRe+"\n";
        }
        System.out.print(res);
    }
    public int numOfRecycled(int a,int b)
    {
        int counter=0;             
        for(int i=a;i<b;i++)
        {
            for(int c=b;c>i;c--)
                if(isRecycled(i+"", c+""))
                    counter++;            
        }

        return counter;
    }
    public boolean isRecycled(String num1,String num2)
    {
        if(num1==null||num2==null)
            return false;
        if(num1.length()!=num2.length())
            return false;
        String tmp;
        int leftStart;//,leftEnd;
        int rightStart,rightEnd;
        leftStart=0;
        rightEnd=num1.length();
       for(int i=0;i<num1.length()-1;i++)
       {
           rightStart=rightEnd-i-1;
           tmp="";
           tmp+=num1.substring(rightStart, rightEnd);
           tmp+=num1.substring(leftStart, rightStart);
           
           if(tmp.equals(num2))
               return true;           
       }
       return false;
    }
}