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

package recycled;

import java.io.BufferedReader;
import java.io.DataInputStream;
import java.io.FileInputStream;
import java.io.FileWriter;
import java.io.InputStreamReader;
import java.io.PrintWriter;
import java.util.TreeSet;

/**
 *
 * @author Alfred
 */
public class Main {

    /**
     * @param args the command line arguments
     */
    public static void main(String[] args) {
    try {
            FileInputStream fstream = new FileInputStream("C-small-attempt0.in");
            DataInputStream in = new DataInputStream(fstream);
            BufferedReader br = new BufferedReader(new InputStreamReader(in));
            FileWriter outFile = new FileWriter("out.txt");
            PrintWriter out = new PrintWriter(outFile);
            String line;
            line = br.readLine();
            int cases = Integer.parseInt(line);
            for (int i=1; i<=cases;i++){
                line = br.readLine();
                String[] values = line.split(" ");
                int A = Integer.parseInt(values[0]);
                int B = Integer.parseInt(values[1]);
                int total=0;
                for (int n=A; n<=B;n++){
                    TreeSet<String> solutions = new TreeSet<String>();
                    for (int k=1;k<values[1].length();k++){
                        String m = circshift(n,k);
                        int mVal = Integer.parseInt(m);
                        if(mVal<=B && mVal!=n  && mVal> n && !m.startsWith("0") && m.length()==Integer.toString(n).length() )
                        {
                            solutions.add(m);
                        }                   
                    }
                    total+=solutions.size();
                }
                out.println("Case #"+i+": "+total);
            }
            in.close();
            out.close();
        } catch (Exception e) {//Catch exception if any
            System.err.println("Error: " + e.getMessage());
        }

}

    private static String circshift(int n, int k) {
        String nString=Integer.toString(n);
        int len=nString.length();
        String m =  nString.substring(len-k)+nString.subSequence(0, len-k);
        //System.out.println(n+" "+m);
        return m;
    }

}

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

import java.io.*;
import java.util.LinkedList;
import java.util.Scanner;

/**
 *
 * @author Student
 */
public class Test3 {

    public static int rotations(int number, int max) {


        int l = 0;
        int start = number;
        int numdigits = (int) Math.log10((double) number); 
        int multiplier = (int) Math.pow(10.0, (double) numdigits);
        while (true) {
            int q = number / 10;
            int r = number % 10;
            number = number / 10;
            number = number + multiplier * r;
            if (number > start && Integer.toString(number).length() == numdigits + 1 && number <= max) {
                l++;
            }
            if (number == start) {
                break;
            }

        }
        return l;
    }
    
    public static int possibilities(int A, int B){
        int K = 0;
        for (int i = A; i <= B; i++) {
            K += rotations(i,B);
        }
        return K;
    }

    public static void main(String[] args) throws FileNotFoundException {
        // TODO code application logic here
        
        int i=1;
        int max = 0;
        Scanner ss=new Scanner(new File("C-small-attempt1.in.txt"));
        PrintWriter x=new PrintWriter(new File("C-small-attempt1.out.txt"));
        if(ss.hasNext()) max=Integer.parseInt(ss.next());
        while(ss.hasNextLine()&&i<=max){
            int A = 0;
            if(ss.hasNext()) A=Integer.parseInt(ss.next());
            int B = 0;
            if(ss.hasNext()) B=Integer.parseInt(ss.next());
            x.println("Case #"+i+": "+possibilities(A, B));
            i++;
        }
        x.close();
        }
    }
