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.BufferedReader;
import java.io.File;
import java.io.IOException;
import java.io.InputStreamReader;
import java.io.*;


public class GoogleCodeInP3{
    
    //processing file
    public static void main(String[] args) throws IOException {
        BufferedReader dog = new BufferedReader(new FileReader(args[0]));
        int a = -1;
        try {
            a = Integer.parseInt(dog.readLine());
        }
        catch (Exception e) { }
        FileWriter file = new FileWriter("outputFile8");
        BufferedWriter cat = new BufferedWriter(file);
        for (int i = 0; i < a; i++) {
            String line = dog.readLine();
            String[] barf= line.split(" ");
            cat.write("Case #" + (i + 1) + ": " + GoogleCodeInP3.solver(Integer.parseInt(barf[0]),Integer.parseInt(barf[1])));
            if (i < a - 1) { 
                cat.write("\n"); 
            }
        }
        cat.close();
    }
    
    
    
    public static int solver(int a, int b){
        int totalRecycledPair = 0; // returns the total number of recyled pairs 
        int m= a+1;
        for (int n= a; n < m; n++){
               for (m= n + 1; m < b+1; m++){
                   if ((m+"").length() == (n+"").length()){
                       String interN= n+"";
                       if (Integer.parseInt(interN) == m){
                           totalRecycledPair++;
                       }
                       for (int i= 0; i < interN.length(); i++){
                           interN= interN.charAt(interN.length()-1) + interN.substring(0,interN.length()-1);
                           if (Integer.parseInt(interN) == m){
                               totalRecycledPair++;
                           }
                       }
                   }
                }
         }
       return totalRecycledPair;
    }
}