import java.io.*;

class code1
{
	public static void main(String args[]) throws Exception 
	{
		File ii = new File ("C-small-attempt1.in");
		FileInputStream fis = new FileInputStream(ii);
		BufferedReader  br = new BufferedReader(new InputStreamReader (fis));
		int cases = Integer.parseInt(br.readLine());
		FileOutputStream fout = new FileOutputStream ("output.txt");
		DataOutputStream dout = new DataOutputStream (fout);
		int total=0;
		for(int i=0;i<cases;i++){
		String temp = br.readLine();
		String parts [] = temp.split(" ");
		int lower = Integer.parseInt(parts[0]);
		int upper = Integer.parseInt(parts[1]);
		System.out.println(lower+" "+upper);
		
		for(int j=lower;j<=upper;j++)
		{
			int abc = j;int length=0;
			if(j<10)continue;
			while (abc!=0){abc/=10;length++;}
			abc=j;
			for(int m=0;m<length-1;m++){
				int shift = abc%10;
				abc=abc/10;
				System.out.println("hi "+j);
				abc=abc+shift*power(10,length-1);
				if(abc<=upper&&shift!=0&&abc>j)total++;
				System.out.println(total);
			}
		}
 		dout.writeBytes("Case #"+(i+1)+ ": "+total+"\n");
 		total=0;
		}//for close
		
	}

	private static int power(int i, int j) {
		int no=1;
		for(int a=0;a<j;a++){no=10*no;}
		return no;
	}
}
import java.io.File;
import java.io.FileNotFoundException;
import java.util.Scanner;


public class RecycledNumber {
	public static void main (String[] args) throws FileNotFoundException{

		Scanner scan = new Scanner (new File ("input.txt"));
		int caseNumber = scan.nextInt();
		scan.nextLine();
		
		for(int k=0; k<caseNumber; k++){
			int result = 0;
			int A = scan.nextInt();
			int B = scan.nextInt();
			
			for (int i = A ; i <= B ; i++){
				for (int j = 1; j < numberOfDigits(i) ; j++){
					if (digit(i,j)>=digit(i,numberOfDigits(i))){
						if (A <= recycle(i,j) && B >= recycle(i,j) && i<recycle(i,j)){
							result++;
						}
					}

				}
			}
			System.out.println("Case #"+(k+1)+": "+result);
			if (scan.hasNextLine()){
				scan.nextLine();
			}
		}

	}
	
	static int numberOfDigits(int number){
		return ((int)Math.floor(Math.log10(number))) + 1;
	}
	
	static int recycle(int number, int digit){
		int newPrefix =  (((int)(number%Math.pow(10, digit)))*(int)Math.pow(10, (numberOfDigits(number)-digit)));
		int newSuffix = number/(int)(Math.pow(10, digit)) ;
		return newPrefix+newSuffix;
	}
	
	static int digit(int number, int digit){
		return (number/(int)(Math.pow(10,digit-1)))%10;
	}
}
