/*
 * 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.StringTokenizer;
import java.util.TreeSet;

public class C {
    public static void main(String [] args) throws IOException {
        TreeSet<String> ts=new TreeSet<String>();
        BufferedReader br=new BufferedReader(new InputStreamReader(System.in));
        int c=Integer.parseInt(br.readLine().trim());
        FileWriter fichero = new FileWriter("largoa.txt");
        PrintWriter pw = new PrintWriter(fichero);
        for(int kc=0;kc<c;kc++){
            int l,h;
            StringTokenizer st=new StringTokenizer(br.readLine());
            l=Integer.parseInt(st.nextToken());
            h=Integer.parseInt(st.nextToken());
            for(int i=l;i<=h;i++){
                String a=String.valueOf(i);
                String n="";
                for(int k=1;k<a.length();k++){
                    n=a.substring(k,a.length())+ a.substring(0,k);
                    if(String.valueOf(Integer.parseInt(n)).length()==a.length() && !n.equals(a)){
                            if(Integer.parseInt(n)<=h &&Integer.parseInt(n)>=l){
                                ts.add(a+" "+n);
                                ts.add(n+" "+a);
                            }
                          }
                    }
                }
            System.out.println("Case #"+(kc+1)+": "+ts.size()/2);
            //pw.println("Case #"+(kc+1)+": "+ts.size()/2);
            ts.clear();
        }
        fichero.close();
    }
}