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.*;
public class RecycledNumbers {
	public static void main(String[] args){
		try{
			Scanner scan = new Scanner(new File("C:/personal/InterviewResource/GoogleCode2012/recycled/C-small-attempt0.in"));
			BufferedWriter output = new BufferedWriter(new FileWriter(new File("C:/personal/InterviewResource/GoogleCode2012/recycled/output.txt")));
			boolean isFirstLine=true;
			int n =0;
			int linecount=0;
			while(scan.hasNextLine()){
				if(isFirstLine){
					isFirstLine=false;
					n= Integer.parseInt(scan.nextLine());
					continue;
				}
				
				String line = scan.nextLine();
				String[] vals = line.split(" ");
				String result="";

				linecount++;
				output.write("Case #"+Integer.toString(linecount)+": "+ getCount(Integer.parseInt(vals[0]), Integer.parseInt(vals[1])));
				output.newLine();
				
			}
			output.close();
			System.out.println("Done");
		}
		catch(IOException e){
			e.printStackTrace();
		}
		
	}
	
	
	public static String getCount(int a, int b){
		int count=0;
		TreeSet<String> repeats = new TreeSet<String>();
		for(int i=a; i<=b; i++){
			//int digits = getDigits(i);
			String astr = Integer.toString(i);
			int n = astr.length();
			for(int j=1; j<n; j++){
				
				String bstr = astr.substring(n-j,n) + astr.substring(0,n-j);
				
				if(isEqual(astr, bstr, b)){
					//System.out.println(astr+ " "+ bstr);
					//System.out.println(bstr);
					if(!repeats.add(astr+bstr)){
						//System.out.println("whoa");
					}
					
					count++;
				}
			}
		}
		String res = Integer.toString(repeats.size());
		return res; 	
	}
	
	public static boolean isEqual(String A, String B, int limit){
		boolean result = false;
		//String A = Integer.toString(a);
		//String B = Integer.toString(b);
		if(B.startsWith("0")) return false;
		int a = Integer.parseInt(A);
		int b = Integer.parseInt(B);
		if(a==b || b>limit || b<=a) return false;
		
		char[] Achar = A.toCharArray();
		Arrays.sort(Achar);
		String Astr = new String(Achar);
		
		char[] Bchar = B.toCharArray();
		Arrays.sort(Bchar);
		String Bstr = new String(Bchar);
		
		if(Astr.equals(Bstr)){
			return true;
		}
		return false;
	}
	
	public static int getDigits(int x){
		int res=0;
		while (x>0){
			int z =x%10;
			if(z>0) res++;
			x=x/10;
		}
		return res;
	}
}
