/*
 * To change this template, choose Tools | Templates
 * and open the template in the editor.
 */

package Happy;
import java.io.*;
import java.math.*;
import java.lang.*;
import java.util.*;
import java.util.Arrays.*;
import java.io.BufferedReader;
//import java.io.IOException;
//import java.io.InputStreamReader;
//import java.io.PrintWriter;
//import java.util.StringTokenizer;

/**
 *
 * @author ipoqi
 */
public class Happy {

    /**
     * @param args the command line arguments
     */
    public static void main(String[] args) {
        new Happy().haha();
    }

    public void haha() {
        BufferedReader in = null;
        BufferedWriter out = null;
        try{
            in = new BufferedReader(new FileReader("C-large.in"));
            out = new BufferedWriter(new FileWriter("LLL.out"));
            int T = Integer.parseInt(in.readLine());
            System.out.println("T="+T);

            //LinkedList<Integer> mm = new LinkedList<Integer>();
            //mm.add(new LinkedList<Integer>());
           //int[][] mm;
           //for(int ii=0;ii<mm.length;ii++){
           //     mm[0][ii] = 1;
           //}


            for(int i=0;i<T;i++){
                String[] line = in.readLine().split(" ");
                int A = Integer.parseInt(line[0]);
                int B = Integer.parseInt(line[1]);
                //System.out.print(" A = "+A+"\n");
                //System.out.print(" B = "+B+"\n");

                int ans = 0;

                
                for(int j=A;j<B;j++){
                    int n=j;
                    if(n>=10){
                        String N = Integer.toString(n);
                        int nlen = N.length();
                        List<Integer> oks = new ArrayList<Integer>();
                        for(int k=0;k<nlen-1;k++){
                            String M = "";
                            for(int kk=1;kk<=nlen;kk++){
                                 M = M + N.charAt((k+kk)%nlen);
                            }
                            int m = Integer.parseInt(M);
                            //System.out.print(" N = "+N+"\n");
                            //System.out.print(" M = "+M+"\n");

                            if(m>n && m<=B) {
                                boolean isNewOne = true;
                                for(int kkk=0;kkk<oks.size();kkk++){
                                    //System.out.print(" KKK = "+oks.get(kkk)+"\n");
                                    if(m==oks.get(kkk)){
                                        isNewOne = false;
                                    }
                                }
                                if(isNewOne){
                                    //System.out.print(" N = "+N+"\n");
                                    //System.out.print(" M = "+M+"\n");
                                    oks.add(m);
                                    ans++;
                                }
                            }
                        }
                    }
                }
                out.write("Case #"+(i+1)+": "+ans+"\n");
                System.out.print("Case #"+(i+1)+": "+ans+"\n");
            }
            in.close();
            out.close();
        }catch(Exception e){
            e.printStackTrace();
            try{
                in.close();
                out.close();
            }catch(Exception e1){
                e1.printStackTrace();
            }
        }
        System.out.print("YES!\n");
    }

}
/*
 * To change this template, choose Tools | Templates
 * and open the template in the editor.
 */
package Qualification;


import java.io.FileReader;
import java.io.FileWriter;
import java.io.IOException;
import java.io.PrintWriter;
import java.util.Scanner;
import java.util.logging.Level;
import java.util.logging.Logger;
/**
 *
 * @author abdallah gaber
 */
public class RecycledNumbers {
      ///////////////////////////variables////////////////
   

    public static void main(String[] args)
    {   
        int res= 0 ,A,B,counter,number;
        String sA,sB,temp;
        int[] array = new int[7];
        int cntarray=0;
        boolean flag = true;
        PrintWriter pw = null;
        Scanner sc = null;
        try {
                sc = new Scanner(new FileReader("C:\\Users\\abdallah gaber\\Documents\\NetBeansProjects\\CodeJam2012\\src\\Qualification\\Clargeinput.in"));
                pw = new PrintWriter(new FileWriter("C:\\Users\\abdallah gaber\\Documents\\NetBeansProjects\\CodeJam2012\\src\\Qualification\\Clargeoutput.out"));
                int casCnt=Integer.parseInt(sc.nextLine());
                for(int cnt=0;cnt<casCnt;cnt++)
                {
                    A=sc.nextInt();
                    B=sc.nextInt();
                    //System.out.println(A+"  "+B);
                    sB=String.valueOf(B);
                    //System.out.println(sB.substring(1));
                    for(int j=A;j<=B;j++)
                    {
                        sA=String.valueOf(j);
                        counter=sA.length();
                        int count=counter;
                        array[cntarray]=j;
                        cntarray++;
                        temp=sA;
                        while(count>1)
                        {
                            //System.out.println(sA.substring(((counter-count)+1), (counter))+" "+sA.substring((counter-count)));
                            temp =  temp.substring(1,counter) + temp.charAt(0);
                            number = Integer.parseInt(temp);
                            for (int t=0;t<cntarray;t++)
                                if(number==array[t])
                                {
                                    flag=false;
                                    break;
                                }
                            if(flag==true)
                            {
                                array[cntarray]=number;
                                cntarray++;
                            }
                            //System.out.println("aa"+j+" "+number);
                            if(number<=B&&number>=A&&j<number&&flag)
                            {
                               // System.out.println(j+" "+number);
                                res++;
                            }
                            count--;
                            flag=true;
                        }
                        cntarray=0;
                        flag=true;
                    }
                    pw.println("Case #"+(cnt+1)+": "+res);
                    res=0;
                    cntarray=0;
                }
        } catch (IOException ex) {
            Logger.getLogger(Speaking_in_Tongues.class.getName()).log(Level.SEVERE, null, ex);
        } finally {
            pw.flush();
            pw.close();
            sc.close();
        }
    }
    
}
