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

}


import java.io.*;

/*
 * To change this template, choose Tools | Templates and open the template in
 * the editor.
 */
/**
 * Problem C. Recycled Numbers
 *
 * @author admin
 */
public class ProblemC_RecycledNumbers {

    public static void main(String[] args) throws FileNotFoundException, IOException {
        BufferedReader br = new BufferedReader(new InputStreamReader(new FileInputStream("c:/C-small-attempt0.in")));

        br.readLine();  // Ignore T

        StringBuilder sb = new StringBuilder();
        int row = 1;

        for (String line = br.readLine(); line != null; line = br.readLine()) {
            sb.append("Case #");
            sb.append(row);
            sb.append(": ");
            int ret = 0;
            String[] numbers = line.split(" ");
            int A = Integer.parseInt(numbers[0]);
            int B = Integer.parseInt(numbers[1]);
            
            for (int m = A+1; m <= B; m++) {
                for (int n = A; n < m; n++) {
                    if(recycled(n, m)) {
                        ret++;
                    }
                }
            }
            
            sb.append(ret);
            System.out.println(ret);
            sb.append('\n');
            row++;
        }
        
        File file=new File("ProblemC_RecycledNumbers.out");
        DataOutputStream output=new DataOutputStream(new FileOutputStream(file));
        output.write(sb.toString().getBytes());
        output.close();

    }

    public static boolean recycled(int n, int m) {
        
        String strN = String.valueOf(n);
        String strM = String.valueOf(m);
        
        for(int i=1; i<strN.length(); i++) {
            String temp = strN.substring(i) + strN.substring(0, i);
            
            if(strM.equals(temp)) {
                return true;
            }
        }

        return false;
    }
}
