/*
 * 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.*;
import java.io.*;

public class C {
	public static int computeDigits(int x){
		if(x<10){
			return 1;
		}else{
			return 1+computeDigits(x/10);
		}
	}
	public static boolean recycled(int x, int y){
		int n = computeDigits(x);
		for(int i = 1;i<n;i++){
			int c = (int)Math.pow(10,i);
			int number = x/c;
			int mod = x%c;
			int newNumber = (mod*(int)Math.pow(10,n-i))+number;
			//System.out.println(newNumber);
			if(newNumber == y) return true;		
		}
		return false;
	}	

	public static void main(String []args){
		Scanner input = new Scanner(System.in);
		int cases = input.nextInt();
		int []result = new int[cases];
		//input.nextLine();
		for(int i = 0; i < cases ;i++){
			int a = input.nextInt();
			int b = input.nextInt();
			if(a<10 || b<10){
				result[i]=0;
			}else{
				for(int j = a; j<b;j++){
					for(int k=a+1;k<=b;k++){
						if(j<k && recycled(j,k)) result[i]++;
					}
				}
			}
		}
		
		try {
			BufferedWriter output = new BufferedWriter(new FileWriter("outfilename.txt"));
			for(int i = 1; i<=cases ;i++){
			System.out.println("Case #"+i+": "+result[i-1]);
			output.write("Case #"+i+": "+result[i-1]+"\n");
			
			}
			output.close();
		} catch (IOException e) {
		}
		
		
	}
	




}