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.*;
import java.util.Collection;
import java.util.HashMap;
import java.util.HashSet;
import java.util.Iterator;
import java.util.Set;

public class NumberMagic {
	public static void main(String[] args) throws NumberFormatException, IOException {
		BufferedReader in = new BufferedReader(new FileReader("input.small"));
		int cases = Integer.parseInt(in.readLine());
		String [] tests = new String[cases];
		Set set = new HashSet<String>();
		for(int i=0;i<cases;i++){
			set.clear();
			tests[i] = in.readLine();
			int A = Integer.parseInt(tests[i].split(" ")[0]);
			int B = Integer.parseInt(tests[i].split(" ")[1]);
			
			for(int j=A;j<=B;j++){
                 for(int k=j+1;k<=B;k++){
                	 String s1 = Integer.toString(j);
                	 String s2 = Integer.toString(k);
                	 if(s2.length()!=s1.length() && s1.equalsIgnoreCase(s2)){
                		 continue;
                	 }
              		 if((s1 = s1.concat(s1)).contains(s2)){
                        set.add(s1+" "+s2);
              		 }                		    
                 }
			}
			System.out.println("Case #"+(i+1)+": "+set.size());
		}
	}

}
