/*
 * 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.*;
import java.util.*;
public class C {
	public static int a;
	public static int b;
	public static void main(String[] args) throws Exception{
		File f = new File("C-small-attempt0.in");
		Scanner sc = new Scanner(f);
		BufferedWriter bw = new BufferedWriter(new FileWriter("output.txt"));
		int n = sc.nextInt();
		for(int i = 0;i<n;i++) {
			a = sc.nextInt();
			b = sc.nextInt();
			bw.write("Case #"+(i+1)+": "+count(a,b));
			bw.write("\r\n");			
		}
		bw.close();
		sc.close();
	}
	public static int count(int a,int b) {
		int k = 0;
		int temp = a;
		int total = 0;
		int temp2;
		while(temp>0) {
			k++;
			temp /=10;
		}
		int [] v = new int[k+1];
		for(int i = a;i<=b;i++) {
			temp = 0;
			temp2 = i;
			for(int j = 0;j<k;j++) {				
				temp2 =  (temp2%10)*((int)Math.pow(10,k-1)) + temp2/10;
				if(temp2>i&&temp2<=b) {
					v[temp] = temp2;
					temp++;
					for(int t = 0;t<temp-1;t++) {
						if(v[t]==temp2){
							temp--;
							break;
						}
					}					
				}
			}
			total +=temp;			
		}	
		return total;
	}
}