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.*;

class p3
{
	public static void main(String s[])
	{
		int startingnum;
		int endingnum;
		int totalcases;
		int pairs;
		try{
			File f = new File("C-small-attempt0.in");
			File o = new File("Output.out");
			String strLine=null;
			int first=1;

			BufferedReader br = new BufferedReader(new FileReader(f));
			PrintWriter out = new PrintWriter(new FileWriter(o));
			 
			strLine = br.readLine();
			totalcases=Integer.parseInt(strLine);
			
			for(int i=0; i<totalcases; i++)	
			{
				strLine = br.readLine();
				String nums[]=strLine.split(" ");
				startingnum=Integer.parseInt(nums[0]);
				endingnum=Integer.parseInt(nums[1]);
//				System.out.println("Start:"+startingnum+" End:"+endingnum);
				pairs=findPairs(startingnum,endingnum,out);
//				if(first==1)
//				{
					out.println("Case #"+(i+1)+": "+pairs);
//					first=0;
//				}
//				else if(first==0)
//					out.println("\n"+"Case #:"+i+": "+pairs);
			}
			br.close();
			out.close();
		}catch (Exception e)
		{//Catch exception if any
		System.err.println("Error: " + e.getMessage());
		}
	}
	
	
	static int findPairs(int startingnum, int endingnum, PrintWriter out)
	{
		int currentnum=startingnum;
		int pairs=0;
		ArrayList<String> arl = new ArrayList<String>();
		
		for(currentnum = startingnum; currentnum <= endingnum; currentnum++)
		{
//			System.out.println();
			String curr=currentnum+"";
			String rotatednum=null;
			
			try{		
				for(int i=0; i<curr.length()-1; i++)
				{
					if(curr.charAt(curr.length()-1)=='0')
						continue;
					rotatednum=curr.substring(0,curr.length()-1);
					rotatednum=curr.substring(curr.length()-1,curr.length())+rotatednum;
//					System.out.println("Currentnum:"+currentnum+" Trying for:"+rotatednum);
					if( (Integer.parseInt(rotatednum) )>startingnum && ( Integer.parseInt(rotatednum) )<endingnum)
					{
						if(arl.indexOf(currentnum+" "+rotatednum)== -1 && arl.indexOf(rotatednum+" "+currentnum)== -1 && currentnum != Integer.parseInt(rotatednum))
						{
//							out.println("Pair Found for:"+currentnum+" and "+rotatednum);
							arl.add(currentnum+" "+rotatednum);
							pairs++;
						}
					}
					curr=rotatednum;
				}
			}catch(Exception e)	{
			}

		}
		return pairs;
	}
}
