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.BufferedReader;
import java.io.FileReader;
import java.io.IOException;
import java.io.PrintWriter;
import java.util.ArrayList;
import java.util.List;

public class Recycle {

	public static void main(String[] args) throws IOException {
		long t0 = System.currentTimeMillis();
		BufferedReader in = new BufferedReader(new FileReader("in.txt"));
		PrintWriter out = new PrintWriter("out.txt");
		int t = Integer.parseInt(in.readLine());
		for (int i = 1; i <= t; i++) {
			String[] ss = in.readLine().split(" ");
			int from = Integer.parseInt(ss[0]);
			int to = Integer.parseInt(ss[1]);
			out.println("Case #" + i + ": " + compute(from, to));
			System.out.println("Case #" + i + ": " + compute(from, to));
		}
		out.close();
		System.out.println("time: " + (System.currentTimeMillis() - t0));
	}

	private static int[] maxNum = { 0, 9, 99, 999, 9999, 99999, 999999, 2000000 };
	private static int[] precomputed = { 0, 0, 36, 801, 12060, 161982, 2023578, 299997 };

	private static int compute(int from, int to) {
		int dFrom = from <= 9 ? 1 : from <= 99 ? 2 : from <= 999 ? 3 : from <= 9999 ? 4 : from <= 99999 ? 5 : from <= 999999 ? 6 : 7;
		int dTo = to <= 9 ? 1 : to <= 99 ? 2 : to <= 999 ? 3 : to <= 9999 ? 4 : to <= 99999 ? 5 : to <= 999999 ? 6 : 7;
		int count;
		if (dFrom == dTo) {
			count = compute(from, to, dFrom);
		} else {
			count = 0;
			count += compute(from, maxNum[dFrom], dFrom);
			for (int i = dFrom + 1; i < dTo; i++) {
				// count += compute(maxNum[i - 1] + 1, maxNum[i], i);
				count += precomputed[i];
			}
			count += compute(maxNum[dTo - 1] + 1, to, dTo);
		}
		return count;
	}

	private static int compute(int from, int to, int digits) {
		int count = 0;
		int f = 1;
		for (int d = 1; d < digits; d++) {
			f *= 10;
		}
		List<Integer> recycled = new ArrayList<Integer>();
		for (int n = from; n <= to; n++) {
			recycled.clear();
			int m = n;
			for (int d = 1; d < digits; d++) {
				int r = (m % 10);
				m = (r * f) + (m / 10);
				if (r > 0 && m < n && m >= from && m <= to) {
					if (recycled.contains(m)) {
						// System.out.println("(" + m + "," + n + ")");
					} else {
						recycled.add(m);
						count++;
					}
				}
			}
		}
		return count;
	}

}
