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.*;

public class CodeJamC {
	public static void main (String[] args) throws IOException {
		int i, j, k;
		long startTime = System.currentTimeMillis();
		File inFile  = new File("C-small-attempt0.in");  // File to read from
		File outFile = new File("C-small.out");
		
		BufferedReader reader = new BufferedReader(new FileReader(inFile));
		BufferedWriter writer = new BufferedWriter(new FileWriter(outFile));
	
			
		String line = null;
		line = reader.readLine();
		int cases = Integer.parseInt(line);
		int counter = 1;
		
        while ((line=reader.readLine()) != null) {
        	int A,B;
        	int pairs = 0;
        	
        	String[] node = line.split(" ");
        	A = Integer.parseInt(node[0]);
        	B = Integer.parseInt(node[1]);
        	        
        	if ((node[0].length() == 1) || (A == B)) {
        		;
        	} else if (node[0].length() == 2) {
        		for(i = A; i <= B; i++) {
        			int oneth = i % 10;
        			int tenth = i /10;
        			int newNum = oneth*10+tenth; 
        			if(newNum > i && newNum <= B)
        				pairs++;
        		}
        	} else if (node[0].length() == 3) {
        		for(i = A; i <= B; i++) {
        			int oneth = i % 10;
        			int tenth = (i /10) % 10;
        			int hunth = i /100;
        			int newNum1 = oneth*100+hunth*10+tenth;
        			int newNum2 = tenth*100+oneth*10+hunth;
        			if(newNum1 > i && newNum1 <= B)
        				pairs++;
        			if(newNum2 > i && newNum2 <= B)
        				pairs++;
        		}
        	}
        	
        	//System.out.println("Case #"+counter+": "+pairs);
        	writer.write("Case #"+counter+": "+pairs);        	
        	writer.newLine();
        	counter++;        		
        }
        
        writer.close();       
        long endTime   = System.currentTimeMillis();
        long totalTime = endTime - startTime;
        System.out.println("Total Time: " + totalTime);		
	}
 }
