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

import java.io.BufferedReader;
import java.io.BufferedWriter;
import java.io.File;
import java.io.FileInputStream;
import java.io.FileNotFoundException;
import java.io.FileOutputStream;
import java.io.IOException;
import java.io.InputStreamReader;
import java.io.OutputStreamWriter;
import java.util.Collection;
import java.util.HashMap;
import java.util.HashSet;
import java.util.Map;
import java.util.Set;

/**
 *
 * @author malte
 */
public class RecycledNumbers {

    static int caseNum = 0;
    static BufferedReader reader;
    static BufferedWriter writer;
    
    public static void main(String[] args) throws FileNotFoundException, IOException {
        
        reader = new BufferedReader(new InputStreamReader(new FileInputStream("./in")));
        
        new File("./out").createNewFile();
        writer = new BufferedWriter(new OutputStreamWriter(new FileOutputStream("./out")));
        
        reader.readLine();  // Skip numberofcases
        String input;
        while ((input = reader.readLine()) != null) {
            input = input.trim();
            String[] numbers = input.split(" ");
            write(getPairCount(numbers[0], numbers[1]));
        }
    }
    
    static int getPairCount(String aStr, String bStr) {
        
        int a = Integer.parseInt(aStr);
        int b = Integer.parseInt(bStr);
        
        if (a < 10 || a == b) {
            return 0;
        }
        
        HashMap<Integer, Set<Integer>> pairs = new HashMap<Integer, Set<Integer>>();
        
        for (int i = a; i <= b; i++) {
            String iStr = Integer.toString(i);
            for (int swaplength = 1; swaplength < iStr.length(); swaplength++) {
                
                int indexToSwap = iStr.length() - swaplength;
                
                if (iStr.charAt(indexToSwap) != '0' && Integer.parseInt("" + iStr.charAt(indexToSwap)) <= Integer.parseInt("" + bStr.charAt(0))) {
                    
                    String newString = iStr.substring(indexToSwap) + iStr.substring(0, indexToSwap);
                    
                    int newInt = Integer.parseInt(newString);
                    if (newInt <= b && newInt > i) {
                        
                        if (pairs.containsKey(newInt)) {
                            
                           if (pairs.get(newInt).contains(i)) {
                               continue;
                           }
                        }
                        
                        Set<Integer> values = pairs.get(i);
                        if (values == null) {
                            
                            values = new HashSet<Integer>();
                            pairs.put(i, values);
                        }
                        
                        values.add(newInt);
                        
                        /*boolean alreadyFound = false;
                        for (int[] pair: pairs) {
                            
                            if ((pair[0] == newInt || pair[1] == newInt) && (pair[0] == i || pair[1] == i)) {
                                
                                alreadyFound = true;
                                break;
                            }
                        }
                        
                        if (!alreadyFound) {
                            pairs.add(new int[]{i, newInt});
                            count++;
                        }*/
                    }
                }
            }
        }
        
        return countEntries(pairs);
    }
    
    public static int countEntries(Map<Integer, Set<Integer>> map) {
        
        int count = 0;
        for (Set set: map.values()) {
            
            count += set.size();
        }
        
        return count;
    }
    
    public static void write(Object out) throws IOException {
        
        caseNum += 1;
        writer.write(String.format("Case #%s: %s%n", caseNum, out));
        writer.flush();
    }
}
