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));
			
		}
		
		
		

	}
	
	
}
package qualifier;

import java.io.File;
import java.io.FileNotFoundException;
import java.io.PrintWriter;
import java.util.HashMap;
import java.util.HashSet;
import java.util.Scanner;
import java.util.Set;

public class TC {
	
	public static void main(String[] args) {
		Scanner in = new Scanner(System.in);
		PrintWriter out = new PrintWriter(System.out);
		try {
			File file = new File("src/qualifier/C-small-attempt0.in");
			String a = file.getAbsolutePath();
			in = new Scanner(file);
			out = new PrintWriter(new File("src/qualifier/C-small-attempt0.out"));
		} catch (FileNotFoundException e) {
			// TODO Auto-generated catch block
			e.printStackTrace();
		}
		
		TC worker = new TC();
		int n = in.nextInt();
		
		for (int i=1; i<=n; i++) {
			out.println("Case #" + i + ": " + worker.nums(in.nextInt(), in.nextInt(), out));
		}
		out.flush();
	}
	
	public int nums(int a,int b, PrintWriter out) {
		int sum = 0;
		int i = a;
		int order = 0;
		while (i>0) {
			i=i/10;
			order++;
		}
			
		for (i=a; i<b; i++) {
			Set<Integer> s = new HashSet<Integer>();
			for (int j=1; j<order; j++) {
				int n1 = 1;
				int n2 = 1;
				for (int k=1; k<=j; k++)
					n1 *= 10;
				for (int k=1; k<=order-j; k++)
					n2 *= 10;
				
				int k1 = i/n1;
				int k2 = i%n1;
				int tr = k2 * n2 + k1;
				if (tr>i && tr<=b && !s.contains(tr)) {
					sum++;
					s.add(tr);
				}
			}
		}
		
		return sum;
	}

}
