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.FileNotFoundException;
import java.io.FileReader;
import java.io.IOException;
import java.util.HashSet;
import java.util.Set;


public class ProblemC {

//	private static String inputFile = "input.txt";
	private static String inputFile = "C-small-attempt0.in";

	public static void main(String[] args) throws IOException {
	    BufferedReader input = null;
		try {
			input =  new BufferedReader(new FileReader(inputFile));

			String line = null;

			int numOfTestCases = 0;
			if ((line = input.readLine()) != null) {
				numOfTestCases = Integer.parseInt(line.trim());
			}

			for (int i = 1; i <= numOfTestCases; i++) {
				if ((line = input.readLine()) != null) {
					String ab = line;
					String[] ab_array = ab.split(" ");
					int a = Integer.parseInt(ab_array[0]);
					int b = Integer.parseInt(ab_array[1]);

					if (a<10 && b<10) {
						System.out.println("Case #" + i + ": 0");
					} else {
						Set<String> recycled = new HashSet<String>();

						if (a < 10) {
							a = 10;
						}
						for (int n=a; n<b; n++) {
							String n_string = "" + n;
							int length = n_string.length();
							for (int j=1; j<length; j++) {
								String m_string = n_string.substring(j) + n_string.substring(0, j);
								int m = Integer.parseInt(m_string);
								if (m>n && m<=b) {
									recycled.add(n_string + ", " + m_string);
								}
							}
						}
						System.out.println("Case #" + i + ": " + recycled.size());
					}
				} else {
					System.out.println("ERROR: Could not read the test case #" + i);
				}
			}
		} catch (FileNotFoundException e) {
			System.out.println("ERROR: FileNotFoundException for the input file.");
			e.printStackTrace();
		} finally {
	        input.close();
		}
	}

}
