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 codejam;
import java.util.Hashtable;
public class RecycledNumbers {
	@SuppressWarnings("unchecked")
	Hashtable h1; 
	@SuppressWarnings("unchecked")
	RecycledNumbers(){
		h1 = new Hashtable();
	}
	@SuppressWarnings("unchecked")
	long noOfPairs(long min, long max, long num){
		String sMin = ""+min;
		String sMax = ""+max;
		String sNum = ""+num;
		
		long countPairs = 0;
		
		int nod = sMin.length();
		int i = 0;
		char fd = sNum.charAt(0);
		for( i = 1; i < nod ; i++){
			
			String block = sNum.substring(i);
			if( block.charAt(0)=='0' || (block.charAt(0)> sMax.charAt(0)) || block.charAt(0)<fd)
				continue;
			else if( block.charAt(0)== sMax.charAt(0)){
				int j = 2;
				boolean can = true;
				for( ; j<= block.length() ;j++){
					String sTemp = block.substring(0,j);
					long temp = Long.parseLong(sTemp);
					temp *= (long)Math.pow(10, nod - j);
					if( temp > max){
						can = false;
						break;
					}
				}
				if( !can ){
					continue;
				}
			}
			
			String sPair = block + sNum.substring(0,i);					
			long pair = Long.parseLong(sPair);
			boolean contains = h1.containsKey(sNum+" "+sPair);
			if( pair > num && pair<=max && !contains){
				h1.put(sNum+" "+sPair, countPairs);
				countPairs ++;
			}
			
		}
		return countPairs;
	}	
	public static void main(String[]args){
		long i = 0;
		long count = 0;
		RecycledNumbers r1 = new RecycledNumbers();
		
		FileRead fr = new FileRead("C-small-attempt0.in");
		FileWrite fw = new FileWrite("C-small-ouput.txt");
		//FileRead fr = new FileRead("C-large-attempt0.in");
		//FileWrite fw = new FileWrite("C-large-ouput.txt");
		
		int t = fr.readNextInt();
		int j = 0;
		long A,B;
		
		for( ; j< t; j++){
			count = 0;
			String nextLine = fr.readNextLine();
			A = Long.parseLong(nextLine.split(" ")[0]);
			B = Long.parseLong(nextLine.split(" ")[1]);
			for( i = A; i < B; i++){
				count += r1.noOfPairs(A,B,i);				
			}
			fw.writeLine("Case #"+(j+1)+": "+count);
		}		
		fr.close();
		fw.close();
	}
	
}
