/*
 * To change this template, choose Tools | Templates
 * and open the template in the editor.
 */
package recyclednumbers;

import java.util.HashSet;

/**
 *
 * @author vandit
 */
public class RecycleNumbers {

    private HashSet<String> numbers = new HashSet<String>();
    private HashSet<String> initialTempNumbers = new HashSet<String>();
    private HashSet<String> finalTempNumbers = new HashSet<String>();

    HashSet<Pair> numberPairs = new HashSet<Pair>();


    private void findRecycledNumbers(int start, int end, int places) {


        for (int i = start; i <= end; i++) {
            String initialNumber = Integer.toString(i);
            //if (!(numbers.contains(initialNumber) || finalTempNumbers.contains(initialNumber))) {

                StringBuffer tempNumber = new StringBuffer(initialNumber);
                int len = tempNumber.length();
                int startIndexToMove = len - places;
                String tempString = tempNumber.substring(startIndexToMove);
                if ((places == 1 && tempString.equals("0")) || tempString.charAt(0) == '0') {
                    continue;
                }
                tempNumber.delete(startIndexToMove, len);
                String finalTempNumber = tempString + tempNumber.toString();

                if (! (finalTempNumber.equals(initialNumber) || Integer.parseInt(finalTempNumber) > end || Integer.parseInt(finalTempNumber) < Integer.parseInt(initialNumber))) {
                    numbers.add(initialNumber);
                    finalTempNumbers.add(finalTempNumber);
                    Pair pair = new Pair(finalTempNumber,initialNumber);
                    numberPairs.add(pair);
                }
            }

        

    }

    public HashSet<Pair> findAllRecycledNumbers(int start, int end) {
        int length = Integer.toString(start).length();
        for (int i = 1; i < length; i++) {
            findRecycledNumbers(start, end, i);
        }
        return numberPairs;
    }
}

import java.io.FileInputStream;
import java.io.FileNotFoundException;
import java.io.FileOutputStream;
import java.io.PrintStream;
import java.util.HashSet;
import java.util.Scanner;
import java.util.Set;

public class Problem3 {
	public static void main(String[] args) throws FileNotFoundException {

		String inputFile = "C-small-attempt0.in";
		Scanner inputScanner = new Scanner(new FileInputStream("d:\\input\\"
				+ inputFile));
		PrintStream ps = new PrintStream(new FileOutputStream(
				"d:\\output\\pro3.txt"));
		int totalCaseNum = inputScanner.nextInt();
		inputScanner.nextLine();
		// -----------------------------------------------

		// -----------------------------------------------
		for (int caseNum = 1; caseNum <= totalCaseNum; caseNum++) {
			String line = inputScanner.nextLine();
			String prefix = "Case #" + caseNum + ": ";
			StringBuilder output = new StringBuilder(prefix);
			// -----------------------------------------------
			Scanner sc = new Scanner(line);
			String A = sc.next();
			String B = sc.next();
			int len = A.length();
			int count = 0;

			int numA = Integer.parseInt(A);
			int numB = Integer.parseInt(B);
			for (int n = numA; n <= numB; n++) {
				String sn = String.valueOf(n);
				StringBuilder sb = new StringBuilder();
				for (int j = 0; j < len - sn.length(); j++) {
					sb.append('0');
				}
				sb.append(sn);
				Set<Integer> recycle = new HashSet<Integer>();
				for (int j = 1; j < len; j++) {
					int m = genRecycleNum(sb, j);
					if (n < m && m <= numB) {
						recycle.add(m);
					}
				}
				count += recycle.size();
			}
			output.append(count);
			// -----------------------------------------------
			System.out.println(output);
			ps.println(output);
		}
	}

	private static int genRecycleNum(StringBuilder sb, int j) {
		String sm = sb.substring(j, sb.length()) + sb.substring(0, j);
//		System.out.println(sb +"::"+sm);
		return Integer.parseInt(sm);
	}
}
