/*
 * 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;
    }
}

//lukewillson
import java.io.PrintStream;
import java.io.File;
import java.util.Scanner;
public class C {    

    public static void main(String[] args) throws Exception {
        new DoC();
    }
}

class DoC {

    public DoC() throws Exception {
        //long time=System.currentTimeMillis();
        System.setOut(new PrintStream(new File("C.out")));
        Scanner sc = new Scanner(new File("C-small-attempt0.in"));
        int runs = Integer.parseInt(sc.nextLine());
        int run = 0;
        while (run++ < runs) {
            System.out.print("Case #" + run + ": ");
            int min=sc.nextInt();
            int max=sc.nextInt();
            int count=0;
            for(int i=min;i<=max;++i)
            {
                for(int j=i+1;j<=max;++j)
                {
                    if(recycle(i,j))
                        count++;
                }
            }
            System.out.println(count);
        }
        //System.out.println(System.currentTimeMillis()-time);
    }
    public boolean recycle(int A,int B)
    {
        String a=""+A;
        String b=""+B;
        for(int i=0;i<b.length();++i)
        {
            String temp=b.substring(i)+b.substring(0,i);
            if(a.equals(temp))
                return true;
        }
        return false;
    }
}
