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.IOException;
import java.io.PrintWriter;
import java.util.HashSet;
import java.util.Set;

class Factory implements TestCaseFactory {

	@Override
	public TestCase getInstance(int number) {
		return new RecycledNumbers(number);
	}
}

public class RecycledNumbers extends TestCase {

	int caseItem;

	int A;
	int B;

	int order;
	int power;

	int count;

	public RecycledNumbers(int caseItem) {
		this.caseItem = caseItem;
	}

	@Override
	public void readInput(BufferedReader in) throws IOException,
			MalformedInputFileException {
		final String str1 = in.readLine();
		final String[] tokens = str1.split("\\s");
		A = Integer.parseInt(tokens[0]);
		B = Integer.parseInt(tokens[1]);
	}

	private int pow(int x, int p) {
		int result = 1;
		for (int i = 0; i < p; i++) {
			result *= x;
		}
		return result;
	}

	private int shift(int x) {
		final int digit = x / power;
		final int remainder = x % power;
		return remainder * 10 + digit;
	}

	private int findNumberOfPairs(int x) {
		final Set<Integer> distint = new HashSet<Integer>();
		distint.add(x);
		int shifted = x;
		for (int i = 0; i < order; i++) {
			shifted = shift(shifted);
			if (shifted >= A && shifted < x) {
				return 0;	// we've already seen all these permutations
			} else if (shifted > x && shifted <= B) {
				distint.add(shifted);
			}
		}
		final int size = distint.size();
		return size * (size - 1) / 2;
	}

	@Override
	public void solve() {
		order = (int) Math.log10(A);
		power = pow(10, order);

		count = 0;
		for (int x = A; x < B; x++) {
			count += findNumberOfPairs(x);
		}
	}

	@Override
	public void writeOutput(PrintWriter out) {
		out.print("Case #" + (caseItem + 1) + ": ");
		out.print(count);
		out.print("\n");

	}

	public static void main(String[] args) throws IOException,
			MalformedInputFileException {
		new Processor().process(new Factory(), args[0], args[1]);
	}
}