import java.io.BufferedReader;
import java.io.BufferedWriter;
import java.io.File;
import java.io.FileReader;
import java.io.FileWriter;
import java.util.ArrayList;
import java.util.Iterator;
import java.util.List;

public class Q3M {
	public static void main(String[] args) throws Exception {
		compute();
	}

	private static void compute() throws Exception {
		BufferedReader br = new BufferedReader(new FileReader(new File(
				"C:\\work\\Q3\\C-small-attempt0.in")));
		String line = null;
		int i = Integer.parseInt(br.readLine());
		List l = new ArrayList();
		for (int j = 0; j < i; j++) {
			line = br.readLine();
			String[] nums = line.split(" ");
			l.add(calculate(nums));
		}
		writeOutput(l);
	}

	private static int calculate(String[] nums) {
		int min = Integer.parseInt(nums[0]);
		int max = Integer.parseInt(nums[1]);
		int count = 0;
		List l = new ArrayList();
		for (int i = min; i <= max; i++) {
			for (int times = 1; times < countDigits(i); times++) {
				int res = shiftNum(i, times);
				if (res <= max && i < res) {
					if ((!l.contains((i + ":" + res)))) {
						l.add(i + ":" + res);
						l.add(res + ":" + i);
						count++;
					}
				}
			}
		}
		return count;
	}

	private static boolean checkZeros(int temp, int res) {
		if (temp % 10 == 0 || res % 10 == 0)
			return false;
		return true;
	}

	private static int shiftNum(int n, int times) {
		int base = (int) Math.pow(10, times);
		int temp2 = n / base;
		int placeHolder = (int) Math.pow((double) 10,
				(double) countDigits(temp2));
		int res = placeHolder * (n % base) + temp2;
		if (countDigits(res) == countDigits(n)) {
			return res;
		} else {
			return 2000001;
		}
	}

	public static int countDigits(int x) {
		if (x < 10)
			return 1;
		else {
			return 1 + countDigits(x / 10);
		}
	}

	private static void writeOutput(List l) throws Exception {
		StringBuffer b = new StringBuffer();
		int i = 1;
		BufferedWriter br = new BufferedWriter(new FileWriter(new File(
				"C:\\work\\Q3\\ans.txt")));
		for (Iterator iterator = l.iterator(); iterator.hasNext();) {
			br.write("Case #" + i++ + ": " + iterator.next());
			br.newLine();
		}
		br.close();
	}

}
import java.io.BufferedWriter;
import java.io.File;
import java.io.FileWriter;
import java.io.IOException;
import java.util.HashSet;
import java.util.Scanner;
import java.util.Set;


public class Recycled {

	private static String fileNameSmall = "/Users/ogokal/Downloads/C-small-attempt0.in";
	private static String outputFilePath = null;
	
	private static void AppendCase(int caseId,String message, BufferedWriter bw) throws IOException{
		bw.write("Case #"+caseId+": "+message+"\n");
	}
	
	private static String OutputFile(String inputFilePath){
		int dotIdx = inputFilePath.lastIndexOf('.');
		return inputFilePath.substring(0, dotIdx)+".out";
	}
	
	private static int Count(int low,int current, int high,int currentIdx, int total,Set<String> counterSet){
		if (currentIdx >= Integer.toString(low).length()) {
			return total;
		}
		String currentStr = Integer.toString(current);
		String begin = currentStr.substring(0,currentIdx);
		String end = currentStr.substring(currentIdx);
		int currentInt = Integer.parseInt(end+begin);
		if (current != currentInt) {
			int min = Math.min(current, currentInt);
			int max = Math.max(current, currentInt);
			if (currentInt >= low && currentInt <= high && !counterSet.contains(min+" "+max)) {
				counterSet.add(min+" "+max);
				++total;
			}
		}
		return Count(low,current,high,currentIdx+1,total,counterSet);
		
	}
	
	public static void main(String[] args) throws IOException {
		
		Scanner scanner = new Scanner(new File(fileNameSmall));
		BufferedWriter bw = new BufferedWriter(new FileWriter(OutputFile(fileNameSmall)));
		int totalCaseCount = scanner.nextInt();
		scanner.nextLine();
		int caseCount = 0;
		while(caseCount < totalCaseCount){
			StringBuffer sb = new StringBuffer();
			int low = scanner.nextInt();
			int high = scanner.nextInt();
			int t = 0;
			Set<String> counterSet = new HashSet<String>();
			for (int i = low; i <= high; i++) {
				t = Count(low,i,high,1,t,counterSet);
			}
			sb.append(t);
			caseCount++;
			System.out.println(sb.toString());
			AppendCase(caseCount,sb.toString(),bw);
			scanner.nextLine();
		}
		bw.flush();
		bw.close();
		
	}

}
