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.*;
import java.util.*;

public class problemC{
	
	public static void main(String args[]) {
		try{
			BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
			
			int T = Integer.valueOf(br.readLine());
			int count, a, b, base;
			String line;
			String[] lineSplit;
			for(int i = 0; i < T; i++){
				line = br.readLine();
				lineSplit = line.split(" ");
				count = 0;
				a = Integer.valueOf(lineSplit[0]);
				b = Integer.valueOf(lineSplit[1]);
				base = base(a);
				for(int j = a; j < b; j++){
					count += switchAround(j, b, base);
				}
				System.out.println("Case #" + (i+1) + ": " + count);
			}
			
		} catch(Exception e){
			
		}
	}		int div = 10;

	
	public static int switchAround(int num, int max, int base){
		int copy = num;
		int count = 0;
		ArrayList<Integer> listN = new ArrayList<Integer>();
		for(int i = 1; i < base; i *= 10) {
			if(num % 10 == 0) {
				num = num/10;
				continue;
			}
			num = num/10 + (num % 10) * base;
			if(num <= max && num > copy && !listN.contains(num)) {
				count++;
				listN.add(num);
			}
		}
		return count;
	}
	
	public static int base(int num){
		int base = 1;
		while(num/base != 0){
			base *= 10;
		}
		
		return base/10;
	}
}