/*
 * 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.Scanner;
public class Rec {
static Scanner sc =new Scanner(System.in);
public  static void main (String [] args ) {
int n =sc.nextInt();

for (int m =1; m <= n; m++) handleCase(m);
}
public static int a,b;
static void handleCase(int num) {
int sum=0;
 a =sc.nextInt();
 b =sc.nextInt();
for (int i =a; i <=b;i++) {
for (int j =a; j <i;j++) {
if (i==j) continue;
sum +=perm(i, j);
}
}
System.out.println("Case #" +num +": "+sum);
}

static int perm(int j, int k) {
String s =new Integer(j).toString();
//boolean [][] f=new boolean[b-a][b-a];
String t =new Integer(k).toString();
int sum =0;
for (int div =1;div < s.length();div++) {
String r =s.substring(div) +s.substring(0,div);
if (r.equals(t)) {
//if (f [j-a][k-a]) System.out.println(s +"&"+t);
//System.out.println(t+"=" +s+"p"+div);
//f [j-a][k-a] =true;
//f [k-a][j-a] =true;
sum++;
break;
}
}
return sum;
}

}
