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.BufferedReader;
import java.io.FileReader;
import java.io.FileWriter;
import java.io.IOException;
import java.util.ArrayList;
import java.util.HashMap;
import java.util.List;
import java.util.Map;


public class Recycled {

	private static final String fileInName = "file.in";
	private static final String fileOutname = "file.out";
	
	public static void main(String[] args) throws IOException{

		System.out.println("Init");
		
		FileWriter fw = new FileWriter(fileOutname);
		BufferedReader br = new BufferedReader(new FileReader(fileInName));
		
		int numCases = Integer.parseInt(br.readLine());
		System.out.println("Num cases: " + numCases);
		
		for(int numCase = 1; numCase <= numCases; numCase++){
			
			String[] caseData = br.readLine().split(" ");
			
			int numA = Integer.parseInt(caseData[0]);
			int numB = Integer.parseInt(caseData[1]);
			
			Map<String, List<String>> prevCalcs = new HashMap<String, List<String>>();
			
			System.out.println("\tA: " + numA +"  B: " + numB);
			
			int numRec = 0;	//Result
			
			for(int i = numA; i < numB; i++){
				
				String nS = String.valueOf(i);
				
				String mS = null;
				
				for( int j = 1; j < nS.length(); j++){
					
					mS = generateRecycled(nS, j);
					
					if(isValid(nS, mS, numB, prevCalcs)){
						numRec++;
						System.out.println("\t\tRecycled: (" + nS +", " +mS +")");
						addToPrevCalcs(nS, mS, prevCalcs);
					}
					
				}
				
			}
			
			System.out.println("\tRes: " + numRec);
			
			fw.write("Case #" + numCase +": " + numRec +"\n");
			
		}
		
		fw.close();
		br.close();
		
	}
	
	private static String generateRecycled(String n, int numToMove){
		
		return n.substring(n.length() - numToMove, n.length()) + n.substring(0, n.length() - numToMove);
		
	}
	
	private static boolean isValid(String nS, String mS, int numB, Map<String, List<String>> map){
		return !mS.startsWith("0") && Integer.parseInt(nS) < Integer.parseInt(mS) 
				&& numB >= Integer.parseInt(mS) && (!map.containsKey(nS) || !map.get(nS).contains(mS));
	}
	
	private static void addToPrevCalcs(String nS, String mS, Map<String, List<String>> map){

		if(!map.containsKey(nS)){
			map.put(nS, new ArrayList<String>());
		}
		
		map.get(nS).add(mS);
		
	}
	
}
