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


public class Recycled {

	private static String fileNameSmall = "/Users/ogokal/Downloads/C-small-attempt0.in";
	private static String outputFilePath = null;
	
	private static void AppendCase(int caseId,String message, BufferedWriter bw) throws IOException{
		bw.write("Case #"+caseId+": "+message+"\n");
	}
	
	private static String OutputFile(String inputFilePath){
		int dotIdx = inputFilePath.lastIndexOf('.');
		return inputFilePath.substring(0, dotIdx)+".out";
	}
	
	private static int Count(int low,int current, int high,int currentIdx, int total,Set<String> counterSet){
		if (currentIdx >= Integer.toString(low).length()) {
			return total;
		}
		String currentStr = Integer.toString(current);
		String begin = currentStr.substring(0,currentIdx);
		String end = currentStr.substring(currentIdx);
		int currentInt = Integer.parseInt(end+begin);
		if (current != currentInt) {
			int min = Math.min(current, currentInt);
			int max = Math.max(current, currentInt);
			if (currentInt >= low && currentInt <= high && !counterSet.contains(min+" "+max)) {
				counterSet.add(min+" "+max);
				++total;
			}
		}
		return Count(low,current,high,currentIdx+1,total,counterSet);
		
	}
	
	public static void main(String[] args) throws IOException {
		
		Scanner scanner = new Scanner(new File(fileNameSmall));
		BufferedWriter bw = new BufferedWriter(new FileWriter(OutputFile(fileNameSmall)));
		int totalCaseCount = scanner.nextInt();
		scanner.nextLine();
		int caseCount = 0;
		while(caseCount < totalCaseCount){
			StringBuffer sb = new StringBuffer();
			int low = scanner.nextInt();
			int high = scanner.nextInt();
			int t = 0;
			Set<String> counterSet = new HashSet<String>();
			for (int i = low; i <= high; i++) {
				t = Count(low,i,high,1,t,counterSet);
			}
			sb.append(t);
			caseCount++;
			System.out.println(sb.toString());
			AppendCase(caseCount,sb.toString(),bw);
			scanner.nextLine();
		}
		bw.flush();
		bw.close();
		
	}

}
