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

}
package google.gcj.recyclednumbers;

import java.io.FileNotFoundException;
import java.util.ArrayList;
import java.util.HashSet;
import java.util.LinkedList;
import java.util.List;
import java.util.Queue;
import java.util.Scanner;
import java.util.Set;

public class RecycledNumbers4 {

	public static void main(String[] args) throws FileNotFoundException {

		RecycledNumbers4 recycledNumbers = new RecycledNumbers4();
		recycledNumbers.doMain();
	}

	private void doMain() throws FileNotFoundException {
		Scanner in = new Scanner(System.in);

		int T = in.nextInt();

		int A, B, m, n, sum;

		for (int zz = 0; zz < T; zz++) {
			A = in.nextInt();
			B = in.nextInt();

			Queue<Integer> queue = new LinkedList<Integer>();
			Set<Integer> nm = new HashSet<Integer>();
			sum = 0;

			for (m = A; m <= B; m++) {
				if (!nm.contains(m)) {
					List<Integer> ml = integerToList(m);
					// new n
					queue.clear();
					for (int i = 0; i < ml.size(); i++) {
						queue.add(ml.get(i));
					}

					for (int j = 0; j < queue.size(); j++) {
						n = integerListToInteger(queue);
						if (A <= n && n < m && m <= B) {
							sum++;
							// System.out.format("Get %d\n", n);

							nm.add(m);
						}
						queue.add(queue.remove());
					}
				}
			}
			System.out.format("Case #%d: %s\n", zz + 1, sum);

		}
	}

	private List<Integer> integerToList(int B) {
		List<Integer> list = new ArrayList<Integer>();
		for (char c : String.valueOf(B).toCharArray()) {
			String s = String.valueOf(c);
			list.add(Integer.valueOf(s));
		}
		return list;
	}

	private int integerListToInteger(Queue<Integer> queue) {
		String s = "";
		for (int l : queue) {
			s += String.valueOf(l);
		}
		return Integer.valueOf(s);
	}

}
