/*
 * 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.util.ArrayList;
import java.util.List;
import java.util.Scanner;

public class RecycledNumber {

	public static void main(String[] args) {
		List<Integer> results = new ArrayList<>();
		int A, B;

		Scanner in = new Scanner(System.in);
		int t = Integer.parseInt(in.nextLine());
		System.out.println();
		for (int i = 0; i < t; i++) {
			String line = in.nextLine();
			A = Integer.parseInt(line.split(" ")[0]);
			B = Integer.parseInt(line.split(" ")[1]);
			results.add(check(A, B));
		}

		System.out.println("Output");
		for (int i = 0; i < results.size(); i++) {
			System.out.println("Case #" + (i + 1) + ": " + results.get(i));
		}
	}

	public static int check(int A, int B) {
		int count = 0;
		List<Integer> M = new ArrayList<>();
		List<Integer> N = new ArrayList<>();
		for (int i = A; i <= B; i++) {
			N.add(i);
			M.add(i);
		}
		for (int i = 0; i < N.size(); i++) {
			String nn = N.get(i) + "";
			int n = Integer.parseInt(nn);
			for (int x = 1; x <= nn.length(); x++) {
				String sufix = nn.substring(0, x);
				String prefix = nn.substring(x);
				int newNum = Integer.parseInt(prefix + sufix);
				for (int j = 0; j < M.size(); j++) {
					int m = M.get(j);
					if (A <= n && n < m && newNum == m && m <= B) {
						count++;
					}
				}
			}
		}
		return count;
	}
}
