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 hu.herba.codejam.cj2012.qualification;

import java.io.BufferedReader;
import java.io.IOException;
import java.io.PrintWriter;
import java.util.Arrays;

import hu.herba.codejam.AbstractCodeJamBase;

/**
 * Recycled Numbers
 * 
 * @author csorbazoli
 */
public class ProblemC extends AbstractCodeJamBase {

    public static void main(String[] args) {
	new ProblemC(args);
    }

    int T; // number of test case

    public ProblemC(String[] args) {
	super(args, AbstractCodeJamBase.READER_TYPE);
    }

    private boolean contains(String[] pairs, int found, String num) {
	boolean ret = false;
	for (int i = 0; i < found; i++) {
	    if (num.equals(pairs[i])) {
		// * TEST */System.out.println("  Pair already found before: " +
		// num);
		ret = true;
		break;
	    }
	}
	return ret;
    }

    private int countRecycled(int A, int B) {
	int result = 0, len;
	String strA = Integer.toString(A);
	String strB = Integer.toString(B);
	String orig, numbers, num;
	len = Integer.toString(A).length();
	String[] pairs = new String[len];
	int found;
	if (len > 1) {
	    for (int i = A; i <= B; i++) {
		orig = Integer.toString(i);
		numbers = orig + orig;
		found = 0;
		for (int j = 1; j <= len; j++) {
		    num = numbers.substring(j, j + len);
		    // each pair was counted twice
		    // if (!num.equals(orig) && (num.compareTo(strA) >= 0)
		    // &&
		    // (num.compareTo(strB) <= 0)) {
		    if ((num.compareTo(orig) > 0) && (num.compareTo(strA) >= 0) && (num.compareTo(strB) <= 0) && !this.contains(pairs, found, num)) {
			// *TEST*/ System.out.println("  " + orig +
			// " recycled with " +
			// num);
			pairs[found++] = num;
			result++;
		    }
		}
	    }
	}
	// *TEST*/System.out.println(" result: " + result);
	return result;
    }

    /*
     * (non-Javadoc)
     * 
     * @see hu.herba.codejam.AbstractCodeJamBase#process(java.io.BufferedReader,
     * java.io.PrintWriter)
     */
    @Override
    protected void process(BufferedReader reader, PrintWriter pw) throws IOException, IllegalArgumentException {
	// The first line of the input gives the number of test cases, T. T test
	// cases follow, one per line.
	// Each test case consists of a single line containing the integers A
	// and B.
	this.T = this.readInt(reader, "Number of cases");
	int[] items;
	for (int i = 1; i <= this.T; i++) {
	    items = this.readIntArray(reader, "testCase");
	    if (items.length == 2) {
		if (Integer.toString(items[0]).length() != Integer.toString(items[1]).length()) {
		    System.out.println("Test case " + i + " INVALID: A and B has different length - " + Arrays.toString(items));
		}
		// * TEST */System.out.println("Case #" + i + ": input = " +
		// Arrays.toString(items));
		// For each test case, output one line containing "Case #x: y",
		// where x is the case number (starting from 1), and y is the
		// number of recycled pairs (n, m) with A â¤ n < m â¤ B.
		pw.println("Case #" + i + ": " + this.countRecycled(items[0], items[1]));
	    } else {
		System.out.println("Test case " + i + " INVALID: test case should contain 2 integers A, B with same length" + Arrays.toString(items));
	    }
	}
    }
}
