/*
 * 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.File;
import java.io.FileNotFoundException;
import java.io.PrintWriter;
import java.util.Scanner;

public class RecycledNumbers {
    private PrintWriter out;
    private Scanner in;

    private void init() {
    }

    private void solve() {
        int A = in.nextInt();
        int B = in.nextInt();

        int r = 0;
        for (int i = A; i <= B; i++) {
            int j = rotate(i);
            while (i != j) {
                if (i < j && j <= B) {
                    r++;
                }
                j = rotate(j);
            }
        }
        out.println(r);
    }

    private int rotate(int number) {
        int pos = 1;
        while (number % 10 == 0) {
            pos *= 10;
            number /= 10;
        }
        int rest = number % 10;
        number /= 10;
        int numberCopy = number;
        while (numberCopy > 0) {
            pos *= 10;
            numberCopy /= 10;
        }
        return rest * pos + number;
    }

    private void runTests() {
        init();

        int T = Integer.parseInt(in.nextLine());
        for (int i = 0; i < T; i++) {
            out.print("Case #" + (i + 1) + ": ");
            solve();
        }
    }

    private void run() {
        try {
            runTests();
        } finally {
            close();
        }
    }

    private void close() {
        out.close();
        in.close();
    }

    public RecycledNumbers() throws FileNotFoundException {
        this.in = new Scanner(new File("C-small-attempt0.in"));
        this.out = new PrintWriter(new File("C-small-attempt0.out"));
    }

    public static void main(String[] args) throws FileNotFoundException {
        new RecycledNumbers().run();
    }
}
