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.Collections;
import java.util.LinkedList;
import java.util.Scanner;

public class CSmall {
	LinkedList<Integer>[]	map;

	public static void main(String[] args) throws FileNotFoundException {
		CSmall csmall = new CSmall();
		csmall.generateMap(1005);

		Scanner scanf = new Scanner(new File("CSmall_in.txt"));
		int T = scanf.nextInt();

		for (int t = 1; t <= T; t++) {
			int A = scanf.nextInt();
			int B = scanf.nextInt();
			System.out.println("Case #" + t + ": " + csmall.result(A, B));
		}
	}

	int result(	int a, int b) {
		int total = 0;
		for (int n = a; n <= b; n++) {
			int current = countBetween(n, a, b);
			total += current;
		}

		return total;
	}

	int countBetween(	int n, int low, int high) {
		LinkedList<Integer> list = map[n];

		int lowIndex = 0;
		for (; lowIndex < list.size() && list.get(lowIndex) < low; lowIndex++)
			;
		int highIndex = lowIndex;
		for (; highIndex < list.size() && list.get(highIndex) <= high; highIndex++)
			;

		return highIndex - lowIndex;
	}

	void generateMap(	int size) {
		map = new LinkedList[size + 1];

		for (int i = 0; i < map.length; i++) {
			map[i] = new LinkedList<Integer>();
		}

		for (int n = 1; n <= map.length; n++) {
			char[] charsInN = Integer.toString(n).toCharArray();

			for (int j = 0; j < charsInN.length; j++) {

				int rotation = rotateLeft(charsInN);

				if (rotation > size) {
					continue;
				}

				if (rotation < n) {
					map[rotation].add(n);
				}
			}
		}

		for (int i = 0; i < map.length; i++) {
			Collections.sort(map[i]);
		}
	}

	int rotateLeft(	char[] chars) {
		int l = chars.length - 1;
		char c = chars[0];
		for (int i = 0; i < l; chars[i] = chars[++i])
			;

		chars[l] = c;

		return Integer.parseInt(new String(chars));
	}
}
