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.File;
import java.io.IOException;
import java.util.LinkedList;
import java.util.List;
import java.util.Scanner;


public class QuestionC {

	/**
	 * @param args
	 * @throws IOException 
	 */
	public static void main(String[] args) throws IOException {
		File fileread = new File("C-small-attempt0.in.txt");
		File filewrite = new File(QuestionC.class.getName() + "output.txt");
		GCIFileReader fr = new GCIFileReader(fileread);
		GCIFileWriter fw = new GCIFileWriter(filewrite);
		GCIResult res = new GCIResult();
		String s = fr.getLine();
		int n = Integer.parseInt(s);
		List<Integer> m = new LinkedList<Integer>();
		for (int i=0; i < n ; i++)
		{
			String l = fr.getLine();
			Scanner sc = new Scanner(l);
			int tres = 0;
			int tn = 0;
			int tm = 0;
			int newnum = 0;
			int A = sc.nextInt();
			int B = sc.nextInt();
			int length = Integer.toString(A).length();
			length--;
			for(int j=A ; j <= B ; j++)
			{
				int tlength = length;
				m.clear();
				while(tlength>0)
				{
					tn = (int) (j % (Math.pow(10,tlength)));
					tm = (int) (j / (Math.pow(10,tlength)));
					newnum = (int) (tn*(Math.pow(10, Integer.toString(tm).length())) + tm);
					if (!m.contains(newnum) &&newnum <= B  && j < newnum && Integer.toString(tn).length() == tlength && Integer.toString(tm).length() == (length+1 - tlength))
					if (newnum <= B && tn!=0 && j < newnum)
					{
						tres++;
						m.add(newnum);
					}
					tlength--;
				}
			}
			res.addCase(String.valueOf(tres));
		}
		fw.writeResult(res);
	}

}
