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

}
/*
 * Google Code Jam 2012 - Qualification Round (14.04.2012)
 * Thomas "ThmX" DenorÃ©az - thomas.denoreaz@gmail.com
 */

package codejam._2012.qualif;

import java.io.BufferedReader;
import java.io.FileReader;
import java.io.IOException;
import java.io.PrintWriter;
import java.util.HashSet;

public class C {
	
	static final String FILENAME = "C-small-attempt0";

	public static void main(String[] args) throws NumberFormatException, IOException {
		
		BufferedReader reader = new BufferedReader(new FileReader(FILENAME + ".in"));
		PrintWriter writer = new PrintWriter(FILENAME + ".out");
		
		int N = Integer.valueOf(reader.readLine());
		for (int i=1; i<=N; i++) {
			
			String[] nums = reader.readLine().split(" "); // -> A B
			int A = Integer.valueOf(nums[0]);
			int B = Integer.valueOf(nums[1]);
			
			
			HashSet<String> set = new HashSet<String>();
			
			for (int n = A; n <= B; n++) {
				String nStr = String.valueOf(n);
				
				int nLen = nStr.length();
				for (int j = 1; j <= nLen-1; j++) {					
					String mStr = String.valueOf( Integer.valueOf( nStr.substring(nLen-j) + nStr.substring(0, nLen-j) ) );
					
					int m = Integer.valueOf(mStr);
					if ((mStr.length() == nStr.length()) && (n < m) && (m <= B)) {
						set.add(n + ":" + m);
					}
				}
				
			}
			
			writer.println("Case #" + i + ": " + set.size());
		}
		
		writer.flush();
		writer.close();
		reader.close();
	}

}
