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();
	}

}
/**
 * 
 */
package codejam2012.qualification;

import java.io.BufferedReader;
import java.io.BufferedWriter;
import java.io.File;
import java.io.FileReader;
import java.io.FileWriter;
import java.io.IOException;

/**
 * @author Jaffar Ramay
 *
 */
public class RecycledNumbers {

	public static void solve() throws IOException {
		BufferedReader reader = new BufferedReader(new FileReader(new File("/Users/jaffar_ramay/Workspaces/eclipseWorkspace/Revision/src/codejam2012/qualification/RecycledNumbers.in")));
		BufferedWriter writer = new BufferedWriter(new FileWriter(new File("/Users/jaffar_ramay/Workspaces/eclipseWorkspace/Revision/src/codejam2012/qualification/RecycledNumbers.out")));
		String line = null;
		while((line=reader.readLine())!=null){
			int testCases = Integer.parseInt(line);
			for (int i = 1; i <= testCases; i++) {
				String[] testCase = reader.readLine().split(" ");
			     int numberA = Integer.parseInt(testCase[0]);
			     int numberB = Integer.parseInt(testCase[1]);
			     int result = getRecycledCount(numberA, numberB);
			     writer.write("Case #"+i+": "+result);
			     if(i<testCases)
			    	 writer.newLine();
			}
		}
		reader.close();
		writer.close();
	}
	public static int getRecycledCount(int numberA, int numberB) {
		int result=0;
		for (int i = numberA; i <= numberB; i++) {
			
			String number = i+"";
			
			for (int j = 0; j < number.length(); j++) {
				
				int firstNumber = Integer.parseInt(number);
				int index = (number.length()-(j+1));
				if(index>0 && index<number.length()){
					int secondNumber =  (Integer.parseInt(number.substring(index,number.length())+number.substring(0,index)));
					
					if(numberA<=firstNumber && firstNumber<secondNumber && secondNumber<=numberB && (firstNumber+"").length() == (secondNumber+"").length()){
						//System.out.println(firstNumber+" "+secondNumber+" ");
						result++;
					}	
				}
				
			}
			
		}
		return result;
	}
	
	public static void main(String[] args) throws IOException {
		//System.out.println("Result = "+getRecycledCount(1111,2222));
		solve();
	}
}
