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.File;
import java.io.FileNotFoundException;
import java.util.ArrayList;
import java.util.Formatter;
import java.util.Scanner;

public class G3 {
	private static Scanner inp;
	private static Formatter out;
	private static int T = 0;
	private static int A = 0;
	private static int B = 0;
	private static int cnt = 0;
	private static ArrayList<Integer> arr;
	private static ArrayList<String> arr2;
	
	public static void main(String[] args) {
		try {
			inp = new Scanner(new File("test.txt"));
		} catch (FileNotFoundException e) {
			System.out.println("File not found!");
		}
		try {
			out = new Formatter("out.txt");
		} catch (FileNotFoundException e) {
			System.out.println("File not found!");
		}
		T = inp.nextInt();
		inp.nextLine();
		arr = new ArrayList<Integer>();
		arr2 = new ArrayList<String>();
		for(int i = 0; i < T; i++) {
			out.format("Case #%d: ", i+1);
			A = inp.nextInt();
			B = inp.nextInt();
			cnt = 0;
			arr.clear();
			arr2.clear();
			for(int j = A; j <= B; j++) {
				for(int k = 1; k < Math.ceil(Math.log10(j)); k++) {
					int tmp = move(j,k);
					//(arr.indexOf(tmp) == -1 || arr.indexOf(j) == -1)
					if(tmp >= A && tmp <= B && (arr2.indexOf(tmp+""+j) == -1 || arr2.indexOf(j+""+tmp) == -1) && tmp != j) {
						cnt++;
						arr.add(j);
						arr.add(tmp);
						arr2.add(tmp+""+j);
						arr2.add(j+""+tmp);
						//System.out.println(j+":"+tmp);
						//break;
					}
				}
			}
			out.format("%d\r\n", cnt);
			//System.out.println("Case #"+(i+1)+": "+cnt);
		}
		inp.close();
		out.close();
	}
	
	public static int move(int n1, int n0) {
		int n2 = n1 % (int) Math.pow(10, n0);
		double n3 = Math.floor(Math.log10(n1));
		int n4 = (n1 - n2) / (int) Math.pow(10, n0);
		double n5 = Math.pow(10, n3+1-n0) * n2;
		double n6 = n5 + n4;
		return (int) n6;
	}
}
