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.FileWriter;
import java.io.IOException;
import java.io.PrintWriter;
import java.util.ArrayList;
import java.util.Collections;
import java.util.LinkedHashSet;
import java.util.List;

public class ProblemB {
	private static List<Integer> digits100(int i) {
		List<Integer> digits = new ArrayList<Integer>();
		while (i > 0) {
			digits.add(i % 10);
			i /= 10;
		}
		Collections.sort(digits);
		return digits;
	}

	private static List<Integer> firstDigits1000(int i) {
		List<Integer> digits = new ArrayList<Integer>();
		digits.add(i % 10);
		digits.add((i - (i % 10)) / 10);
		Collections.sort(digits);
		return digits;
	}

	private static List<Integer> secondDigits1000(int i) {
		List<Integer> digits = new ArrayList<Integer>();
		digits.add(i % 100);
		digits.add((i - (i % 100)) / 100);
		Collections.sort(digits);
		return digits;
	}

	public static void main(String[] args) throws NumberFormatException,
			IOException {

		BufferedReader br = new BufferedReader(new FileReader("C-small-attempt0.in"));
		PrintWriter out = new PrintWriter(new FileWriter("output.txt"));

		ArrayList<List<Integer>> digitsList = new ArrayList<List<Integer>>();
		LinkedHashSet<List<Integer>> digitsSet = new LinkedHashSet<List<Integer>>();

		int testCases = Integer.parseInt(br.readLine());
		for (int i = 1; i <= testCases; i++) {
			out.print("Case #"+i+": ");
			String[] str = br.readLine().split(" ");
			int int1 = Integer.parseInt(str[0]);
			int int2 = Integer.parseInt(str[1]);
			for (int j = int1; j <= int2; j++) {
				if (j < 100) {
					digitsList.add(digits100(j));
					digitsSet.add(digits100(j));
				} else if (j < 1000) {
					if (firstDigits1000(j).get(1) > 9) {
						digitsList.add(firstDigits1000(j));
						digitsSet.add(firstDigits1000(j));
					}
					if (!firstDigits1000(j).equals(secondDigits1000(j))
							&& secondDigits1000(j).get(1) > 9) {
						digitsList.add(secondDigits1000(j));
						digitsSet.add(secondDigits1000(j));
					}

				}
			}
			out.println(digitsList.size() - digitsSet.size());
			for (List<Integer> li : digitsSet) {
				digitsList.remove(digitsList.indexOf(li));
			}
			System.out.println(digitsList.toString());
			System.out.println(digitsList.size());
			// System.out.println(digitsSet.toString());
			// System.out.println(firstDigits1000(100));
			// System.out.println(secondDigits1000(100));
			digitsSet.clear();
			digitsList.clear();
		}

		out.close();
	}

}
