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.util.*;
import java.io.*;

public class C {
	public static int computeDigits(int x){
		if(x<10){
			return 1;
		}else{
			return 1+computeDigits(x/10);
		}
	}
	public static boolean recycled(int x, int y){
		int n = computeDigits(x);
		for(int i = 1;i<n;i++){
			int c = (int)Math.pow(10,i);
			int number = x/c;
			int mod = x%c;
			int newNumber = (mod*(int)Math.pow(10,n-i))+number;
			//System.out.println(newNumber);
			if(newNumber == y) return true;		
		}
		return false;
	}	

	public static void main(String []args){
		Scanner input = new Scanner(System.in);
		int cases = input.nextInt();
		int []result = new int[cases];
		//input.nextLine();
		for(int i = 0; i < cases ;i++){
			int a = input.nextInt();
			int b = input.nextInt();
			if(a<10 || b<10){
				result[i]=0;
			}else{
				for(int j = a; j<b;j++){
					for(int k=a+1;k<=b;k++){
						if(j<k && recycled(j,k)) result[i]++;
					}
				}
			}
		}
		
		try {
			BufferedWriter output = new BufferedWriter(new FileWriter("outfilename.txt"));
			for(int i = 1; i<=cases ;i++){
			System.out.println("Case #"+i+": "+result[i-1]);
			output.write("Case #"+i+": "+result[i-1]+"\n");
			
			}
			output.close();
		} catch (IOException e) {
		}
		
		
	}
	




}