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

}

public class RecycledNumbers {

	public RecycledNumbers() {
	}
	
	public int sumOfDigit (int x)
	{
		int sum = 0;
		while (x >0) 
		{
			sum+=x%10;
			x /=10;
		}
		return sum ;
	}
	
	String n ;
	String m ;
	String temp1_1 ;
	
	public boolean Recycled(int x,int y,int begin) // y > x 
	{
		if (x == y)
			return false ;
		
		if (sumOfDigit(x) != sumOfDigit(y))
			return false ;
		
		n = x+"" ;
		temp1_1 = x+"" ;
		m = y+"" ;
		
		
		while (begin< n.length() && n.charAt(begin) != m.charAt(0))
			begin++;
		
//		System.out.println("i = " + begin);
		
		if (begin == n.length())
			return false ;
		
		n = n.substring(begin);
		n += temp1_1.substring(0,begin);
		
//		System.out.println("1 = " + n);
//		System.out.println("2 = " +m);
		
		if (n.equals(m))
			return true ;
		if (begin<n.length())
			return Recycled(x, y, begin+1);
		else
			return false ;
	}
	
	public int numOfDisRecNum (int min , int max)
	{
		int counter = 0 ;
		
		for (int n =min;n<max;n++)
			for (int m=n+1 ;m<= max ;m++)
			{
				if (Recycled(n,m,0))
					counter ++ ;
			}
		
		return counter;
	}
	public static void main(String[] args) {
		
		RecycledNumbers obj = new RecycledNumbers();
		
		System.out.println(obj.numOfDisRecNum(1111 , 2222));
		
//		System.out.println(obj.Recycled(244,424,0));
		
//		System.out.println(obj.Recycled(12345,34512,0));
		
	}
}

