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.FileReader;
import java.io.FileWriter;
import java.util.HashSet;
import java.util.Scanner;
import java.util.Set;

public class RecycledNumbers {
	final static String FILENAME = "C-small-attempt0";

	public static void main(String[] args) throws Exception {
		Scanner sc = new Scanner(new FileReader("/home/workshop/Documents/"
				+ FILENAME + ".in"));
		BufferedWriter bw = new BufferedWriter(new FileWriter(
				"/home/workshop/Documents/" + FILENAME + ".out"));
		int T = sc.nextInt();
		sc.nextLine();
		for (int ttt = 0; ttt < T; ttt++) {
			int A = sc.nextInt();
			int B = sc.nextInt();

			int count = 0;
			int digits = new Double(Math.floor(Math.log10(A) + 1)).intValue();
			for (int num = A; num < B; num++) {
				Set<Integer> hs = new HashSet<Integer>();
				for (int lastdigits = 1; lastdigits < digits; lastdigits++) {
					int tailmask = new Double(Math.pow(10, lastdigits))
							.intValue(), headmask = new Double(Math.pow(10,
							digits - lastdigits)).intValue();
					int newnum = num / tailmask + (num % tailmask) * headmask;
					if (num < newnum && !hs.contains(newnum) && newnum <= B) {
						// System.out.println(num + "\t" + newnum);
						count++;
						hs.add(newnum);
					}
				}
				// if (y < z) {
				// System.out.println(num + "\t(1)");
				// count++;
				// }
				// if (x < z || (x == z && x > y)) {
				// System.out.println(num + "\t(2)");
				// count++;
				// }
				// if (x < y && y != z) {
				// System.out.println(num + "\t(3)");
				// count++;
				// }
				// if (x < y && x != z) {
				// System.out.println(num + "\t(4)");
				// count++;
				// }
				// if (x < z || (x == z && x > y)) {
				// int newnum = z * 100 + x * 10 + y;
				// if (newnum <= B) {
				// System.out.println(num + "\t" + newnum + "\t(2)");
				// count++;
				// }
				// }
				// if (x < y || (x == y && y < z)) {
				// int newnum = y * 100 + z * 10 + x;
				// if (newnum <= B) {
				// System.out.println(num + "\t" + newnum + "\t(4)");
				// count++;
				// }
				// }
			}

			bw.write("Case #" + (ttt + 1) + ": " + count);
			bw.newLine();
		}
		bw.close();
		sc.close();
	}
}
