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.IOException;
import java.io.BufferedReader;
import java.io.FileReader;
import java.util.HashSet;
import java.util.Set;
import java.util.StringTokenizer;
import java.util.Hashtable;
import java.util.Arrays;

import com.sun.xml.internal.bind.v2.runtime.unmarshaller.IntArrayData;



public class Recycler {
	
	private static int transpose(int num, int numDigits) { 
		//System.out.println("Input number " + num);
		//System.out.println("Number digits to be transposed " + numDigits);
		String inputString = Integer.toString(num);
		String truncatedString1 = inputString.substring(0,inputString.length()-numDigits);
		//System.out.println("Truncated String1 " + truncatedString1);
		String truncatedString2 = inputString.substring(inputString.length()-numDigits);
		//System.out.println("Truncated String2 " + truncatedString2);
		//System.out.println("Output string " +  truncatedString2 + truncatedString1);
		return Integer.valueOf(truncatedString2 + truncatedString1);
		
	}

	public static void main(String[] args) throws IOException{
		
		/* transpose(3234,2);
		transpose(323423242,5);
		transpose(100,1); */
		
 		 if (args.length != 1) {
			System.out.println("Error: incorrect number of arguments.");
			System.out.println("Usage: Recycler <input-filename>");
		} else {
			BufferedReader inputStream = null;
			try {
				 inputStream = new BufferedReader(new FileReader(args[0]));
				 int totalCases = Integer.valueOf(inputStream.readLine()).intValue();
				 //System.out.println("Total number of cases is: "+totalCases);
				 for (int i=0;i<totalCases;i++) {
					System.out.print("Case #"+(i+1)+": ");
					String numbersLine = inputStream.readLine();
					//System.out.println("Numbers line is: "+numbersLine);
					String[] theNumbers = numbersLine.split(" ");
					int lower = Integer.valueOf(theNumbers[0]);
					int higher = Integer.valueOf(theNumbers[1]);
					//System.out.println("Lower number is " +  theNumbers[0]);
					//System.out.println("Higher number is " +  theNumbers[1]);
					int numDigits = Integer.toString(lower).length();
					int output=0;
					Set<String> done = new HashSet<String>();
					for (int l=1;l<numDigits;l++) {
						//each iteration transposes l digits
						for (int k=lower;k<=higher;k++) {
							//System.out.println("Number is " + k);
							//k is the number under consideration;
							
							int otherNumber = transpose(k,l);
							//System.out.println("Other number is " + otherNumber);
							if ((otherNumber>k) &&
								(otherNumber<=higher) &&
								Integer.toString(k).length() == Integer.toString(otherNumber).length() &&
								!done.contains(String.valueOf(new Integer(k)) + String.valueOf(new Integer(otherNumber)))
								) {
								//System.out.println(k+" "+ otherNumber + " Incrementing");
									output++;
									done.add(String.valueOf(new Integer(k)) + String.valueOf(new Integer(otherNumber)));
								}
						}

					}
					System.out.println(output);
				}
			} catch (IOException e) {
				System.out.println("Error in reading file");
			} finally {
				if (inputStream != null) {
					inputStream.close();
				}
			}
		}  
	} 
}