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

public class recycled{
	
	public static void main(String[] args)
	{
		Scanner in = new Scanner(System.in);

		//System.out.println("Hello world!");
		String scases = in.nextLine();
		int cases = Integer.parseInt(scases);

		for(int i =1;i<=cases;i++)
		{
			String line = in.nextLine();
			String[] split = line.split(" ");
			String first = split[0];
			String second = split[1];
			int ifirst = Integer.parseInt(first);
			int isecond = Integer.parseInt(second);
			int count = cases(ifirst,isecond);

			System.out.println("Case #"+i+": "+count);
		}
		//System.out.println(count);
		//cases();
	}
	public static int cases(int lower, int upper)
	{
		int count =0;
		//int lower = 1111;
		//int upper = 2222;
		for(int i =lower; i<=upper; i++)
		{
			for(int j =lower; j<=upper; j++)
			{				
				if(isRecycled(i,j)&&i!=j){
					//System.out.println(i+","+j);
					count++;
				}
			}
		}
		//System.out.println(count/2);
		return count/2;
		//System.out.println(isRecycled(12345,34512));
	}
	public static boolean isRecycled(int a, int b)
	{
		String aa = ""+a;
		String bb = ""+b;

		for(int i=0;i<aa.length();i++){

			String test = aa.substring(i,aa.length()) + aa.substring(0,i);
			//System.out.println(test);
			if(test.equals(bb)){
				return true;
			}
		}

		return false;
	}
}