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.FileWriter;
import java.io.IOException;
import java.util.Scanner;
import java.io.File;
import java.io.FileNotFoundException;
import java.io.FileOutputStream;
import java.io.FileReader;
import java.io.PrintStream;
import java.io.PrintWriter;
import java.io.FileWriter;
import java.io.PrintWriter;
import java.io.IOException;
import java.util.Arrays;


public class Recycled {


	public static void main(String args[]) throws IOException
	{
		try
		{
			PrintWriter wt= new PrintWriter("C:\\Documents and Settings\\windows\\workspace\\test\\src\\file.out.txt");
			Scanner I = new Scanner(new File("C:\\Documents and Settings\\windows\\workspace\\test\\src\\C-small-attempt0.in"));
			String num = I.nextLine();
			int numTests = Integer.parseInt(num);

			for(int x=0; x<numTests; x++)
			{
				int a = I.nextInt();
				int b = I.nextInt();
				int count = 0;
				int arr[] = new int[b-a+1];

				for(int z = 0; z<(b-a+1); z++)
				{  arr[z] = a + z;
				;
				}

				for( int i = 0; i < (b-a+1); i++)
				{
					for(int j = i; j < (b-a+1); j++)
					{
						if( (arr[i] < arr[j]) && (i != j))
						{
							if (isRecycled(arr[i],arr[j])== true)
								count = count + 1;	 

						} 	
					}
				}
				//logic to write result to file
				String finalResult = "Case #"+(x+1)+": "+count;
				wt.println(finalResult);
			}
			wt.close();
			I.close();
		}
		catch(FileNotFoundException e)
		{
			e.printStackTrace();
		}

		catch(IOException e)
		{
			System.out.println(e);
		}
	}


	// Replacement algorithm
	public static boolean isRecycled(int a, int b)
	{  
		//also need to check for size of a and b ?? not needed if we directly compare


		String strA = Integer.toString(a);
		String strB = Integer.toString(b);
		String newStr = null;
		for (int i = 0; i<strB.length(); i++)
		{   
		    newStr = movedFirstToLast(strB);
		    strB = newStr;
			if(strA.equals(newStr))
			{
				return true;
			}
		}		  	
		return false;

	} 


	public static String movedFirstToLast(String a)
	{
		String newString = null;
		String firstChar = a.substring(0,1);
		newString = a.substring(1); // except first character
		newString = newString + firstChar;
        return newString;
	}


}		 

