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

}
import java.io.*;
import java.util.HashSet;
import java.util.Set;

/**
 * ***************************************************************************
 * Created by IntelliJ IDEA.
 * User: Narender Singh Pal
 * Date: 4/14/12
 * Time: 10:59 AM
 * <p/>
 * ***************************************************************************
 * <p/>
 * Copyright (c) 2012 All Rights Reserved.
 * <p/>
 * <p/>
 * ***************************************************************************
 */
public class RecycledNumbers
{
    public static void main (String args[])
    {
        try
        {
            BufferedReader Br = new BufferedReader(new FileReader("C:\\Input\\C-large.in"));
            BufferedWriter Bw = new BufferedWriter(new FileWriter("C:\\Input\\C-large.out"));
            try
            {
                //read number of test cases
                int $TC = Integer.valueOf(Br.readLine());
                System.out.println("Number of Test Cases :"+ $TC);
                int $A, $B;
                int [] $InputNum;
                for(int tc = 1; tc <= $TC; tc++)
                {
                    String $InputStr = Br.readLine();
                    String []TempArr = $InputStr.split(" ");
                    $InputNum = new int[TempArr.length];
                    for(int j =0; j < TempArr.length; j++)
                    {
                        $InputNum[j] = Integer.valueOf(TempArr[j]);
                    }
                    //get numbers A, B from input number pair
                    $A = $InputNum[0];
                    $B = $InputNum[1];
                    int $RecycledPairs = 0;

                    //Iterate the given integer range
                    for( int $n = $A; $n <= $B ; $n++ )
                    {
                        String lStr = String.valueOf($n);
                        int $length = lStr.length();
                        int [] $m = new int[$length-1];
                        Set<Integer> $MSet = new HashSet<Integer>();

                        //for each $n get all possible recycled number
                        for(int k = 1; k < $length; k++ )
                        {
                            StringBuffer s = new StringBuffer();
                            s.append(lStr.subSequence(k,$length));
                            s.append(lStr.subSequence(0,k));
                            $m[k-1] = Integer.valueOf(s.toString());

                            //Recycled pair found if the SA <= $n < $m <= $B
                            if($m[k-1] > $n && $m[k-1] <= $B && $m[k-1] >= $A)
                            {
                                if($MSet.isEmpty())
                                {
                                    $MSet.add($m[k-1]);
                                }
                                else
                                {
                                    if($MSet.contains($m[k-1]))
                                    {
                                        System.out.println("###Repeat : skipping ($n, $m) :("  +$n +", "+ $m[k-1]+")####" );
                                        continue;
                                    }
                                    $MSet.add($m[k-1]);
                                }
                                $RecycledPairs++;
                                System.out.println("$Recycled Pair ("+ $RecycledPairs +") : ($n, $m) :(" +$n +", "+ $m[k-1]+")");
                            }
                        }
                    }
                    System.out.println("Case #"+ tc+": "+$RecycledPairs);
                    Bw.write("Case #"+ tc+": "+ $RecycledPairs);
                    Bw.write('\n');
                }
            }
            finally
            {
                Br.close();
                Bw.close();
            }
        }
        catch (IOException e)
        {
            e.printStackTrace();
        }
    }
}

