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

public class CodeC{
	public static void main(String[] args){
		Scanner sc=new Scanner(System.in);
		int tcase;
		int a, b;
		int numDigit;
		int num;
		
		tcase=sc.nextInt();
		for(int q=1;q<=tcase;q++){
			a=sc.nextInt();
			b=sc.nextInt();
			num=0;
			for(int i=a;i<=b;i++){
				numDigit=(i+"").length();
				int j=i+1;
				int limit=10*j;
				if(limit>b){
					limit=b;
				}
				//System.out.println("DIGIT "+numDigit+" LIMIT "+j+" - "+limit);
				for(;j<=limit;j++){
					String bil=i+"";
					for(int k=0;k<numDigit-1;k++){
						char kanan=bil.charAt(bil.length()-1);
						//System.out.println("AWAL "+bil+"\nKANAN "+kanan);
						bil=kanan+bil.substring(0,bil.length()-1);
						//System.out.println("UBAH "+bil);
						//System.out.println("A "+i+" B "+j+" "+bil.equals(j+""));
						if(bil.equals(j+"")){
							//System.out.println("A "+i+" B "+j);
							num++;
							break;
						}
					}
				}
			}
			System.out.println("Case #"+q+": "+num);
		}
	}
}