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


public class Utils {
	
	private static void quickAscSort(ArrayList list, int low0, int high0) {

		int low = low0, high = high0;

		if (low >= high) {

			return;

		} else if (low == high - 1) {

			if (((Comparable)list.get(low)).compareTo(list.get(high)) > 0) {

				Object temp = list.get(low);

				list.set(low, list.get(high));

				list.set(high, temp);

			}

			return;

		}

		

		Object pivot = list.get((low + high) / 2);

		list.set((low + high) / 2, list.get(high));

		list.set(high, pivot);

		

		while (low < high) {

			while (((Comparable)list.get(low)).compareTo(pivot) <= 0 && low < high) {

				low++;

			}

			while (((Comparable)list.get(high)).compareTo(pivot) >= 0 && low < high) {

				high--;

			}

			if (low < high) {

				Object temp = list.get(low);

				list.set(low, list.get(high));

				list.set(high, temp);

			}

		}

		list.set(high0, list.get(high));

		list.set(high, pivot);

		quickAscSort(list, low0, low - 1);

		quickAscSort(list, high + 1, high0);

	}

	
	private static void quickDescSort(ArrayList list, int low0, int high0) {

		int low = low0, high = high0;

		if (low >= high) {

			return;

		} else if (low == high - 1) {

			if (((Comparable)list.get(low)).compareTo(list.get(high)) > 0) {

				Object temp = list.get(low);

				list.set(low, list.get(high));

				list.set(high, temp);

			}

			return;

		}

		

		Object pivot = list.get((low + high) / 2);

		list.set((low + high) / 2, list.get(high));

		list.set(high, pivot);

		

		while (low < high) {

			while (((Comparable)list.get(low)).compareTo(pivot) >= 0 && low < high) {

				low++;

			}

			while (((Comparable)list.get(high)).compareTo(pivot) <= 0 && low < high) {

				high--;

			}

			if (low < high) {

				Object temp = list.get(low);

				list.set(low, list.get(high));

				list.set(high, temp);

			}

		}

		list.set(high0, list.get(high));

		list.set(high, pivot);

		quickDescSort(list, low0, low - 1);

		quickDescSort(list, high + 1, high0);

	}
	

	public static void sortAscList(ArrayList list) {

		Collections.sort(list) ;
	

	}
	
	public static void sortDescList(ArrayList list) {

		Collections.sort(list,Collections.reverseOrder()) ;

	}
	
	public static ArrayList<String> toStrArrayList(String str)
	{
      StringTokenizer stTokenizer = new StringTokenizer(str) ;
		
		ArrayList<String> readStrList = new ArrayList<String>(stTokenizer.countTokens()) ; 
		
		while(stTokenizer.hasMoreTokens())
		{
			readStrList.add(stTokenizer.nextToken()) ;
		}
		
		return readStrList ; 
	}

	
	public static ArrayList<Integer> toIntArrayList(String str)
	{
      StringTokenizer stTokenizer = new StringTokenizer(str) ;
		
		ArrayList<Integer> readIntList = new ArrayList<Integer>(stTokenizer.countTokens()) ; 
		
		while(stTokenizer.hasMoreTokens())
		{
			readIntList.add(Integer.parseInt(stTokenizer.nextToken())) ;
		}
		
		return readIntList ; 
	}
	
	public static void printArrayList(ArrayList list,String seperator)
	{
         ListIterator iterator = list.listIterator() ;
		
		while(iterator.hasNext())
		{
			System.out.print(iterator.next()) ;
			if(iterator.hasNext()) System.out.print(seperator) ;
			
		}
		
		System.out.print("\n"); 
		
	}
	
	
	public static void reverseArrayList(ArrayList list)
	{
     Collections.reverse(list) ; 
		
	}
	
	
}
 
 

	

