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

}
/*
 * @author Magix.Lu
 */
import java.io.File;
import java.io.FileWriter;
import java.io.IOException;
import java.io.PrintWriter;
import java.util.Scanner;

public class RecycledNum {
	public static void main(String[] args) throws IOException {
		Scanner scanInput = new Scanner(System.in);
		String target = scanInput.next();

		File inputFile = new File(target);
		Scanner fileScan = new Scanner(inputFile);

		String outpFileName = "output.txt";
		FileWriter googlewriter = null;
		googlewriter = new FileWriter(outpFileName);

		PrintWriter diskFile = new PrintWriter(googlewriter);

		int count = fileScan.nextInt();
		int min = 0;
		int max = 0;
		int len = 0;

		int a = 0;
		int b = 0;

		int counter = 0;

		for (int i = 0; i < count; i++) {
			min = fileScan.nextInt();
			max = fileScan.nextInt();

			a = min;
			len = Integer.toString(a).length();
			counter = 0;

			if (len == 1) {
				diskFile.print("Case #" + (i + 1) + ": " + counter + "\n");

				System.out.println(counter);
			} else {
				while (a <= max) {
					b = a;
					String num = Integer.toString(b);

					for (int j = 0; j < len - 1; j++) {

						if (len == 2) {
							String result = Character.toString(num.charAt(1))
									+ num.charAt(0);

							num = result;
							b = Integer.parseInt(result);
						}

						else {

							String front = Character.toString(num.charAt(num
									.length() - 1));
							String behind = num.substring(0, num.length() - 1);

							String result = front + behind;

							num = result;
							b = Integer.parseInt(num);
						}

						if (min <= a && a < b && b <= max) {
							counter++;
							System.out.println(a + "	" + b);
						}

					}

					a++;
				}
				diskFile.print("Case #" + (i + 1) + ": " + counter + "\n");
				System.out.println(counter);
			}
		}

		diskFile.close();

	}

}
