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

}
/**
 * @(#)Main.java
 *
 *
 * @author 
 * @version 1.00 2012/4/14
 */
import java.io.*;

public class Main {
	
	public static void main(String...args)throws IOException {
		BufferedReader br = new BufferedReader(new FileReader("C-small-attempt0.in"));
        FileWriter fstream = new FileWriter("C-small-attempt0.out");
        BufferedWriter out = new BufferedWriter(fstream);
        String in = br.readLine();
        int testCases = Integer.parseInt(in);
        int i = 1;
        
        while(testCases > 0) {
        	in = br.readLine();
        	out.write("Case #" + i + ": " + solve(in) + "\n");
        	testCases--;
        	i++;
        }
        out.close();
	}
	
	public static int solve(String in) {
		String[] data = in.split(" ");
		int a = Integer.parseInt(data[0]);
		int b = Integer.parseInt(data[1]);
		
		int solution = 0;
		
		for(int i = a; i < b; i++) {
			int tmp = i;
			
			do{
				tmp = shift(tmp);
				while (Math.floor(Math.log10(i)) != Math.floor(Math.log10(tmp))){
					tmp *= 10;
				}
				if(tmp > i && tmp <= b){
					solution++;
				}
			}while(tmp != i);
		}
		return solution;
	}
	
	public static int shift(int a){
		int E = firstDigit(a);
		int T = 10 * trailing(a);
		return E + T;
	}
	
	public static int trailing(int x) {
		if (x == 0) return 0;
		return (int) Math.floor(x % Math.pow(10, Math.floor(Math.log10(x))));
	}
	
	public static int firstDigit(int x) {
  		if (x == 0) return 0;
  		return (int) Math.floor(x / Math.pow(10, Math.floor(Math.log10(x))));
	}
    
}