/*
 * 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.BufferedReader;
import java.io.FileNotFoundException;
import java.io.FileReader;
import java.io.IOException;
import java.util.HashSet;
import java.util.Set;


public class ProblemC {

//	private static String inputFile = "input.txt";
	private static String inputFile = "C-small-attempt0.in";

	public static void main(String[] args) throws IOException {
	    BufferedReader input = null;
		try {
			input =  new BufferedReader(new FileReader(inputFile));

			String line = null;

			int numOfTestCases = 0;
			if ((line = input.readLine()) != null) {
				numOfTestCases = Integer.parseInt(line.trim());
			}

			for (int i = 1; i <= numOfTestCases; i++) {
				if ((line = input.readLine()) != null) {
					String ab = line;
					String[] ab_array = ab.split(" ");
					int a = Integer.parseInt(ab_array[0]);
					int b = Integer.parseInt(ab_array[1]);

					if (a<10 && b<10) {
						System.out.println("Case #" + i + ": 0");
					} else {
						Set<String> recycled = new HashSet<String>();

						if (a < 10) {
							a = 10;
						}
						for (int n=a; n<b; n++) {
							String n_string = "" + n;
							int length = n_string.length();
							for (int j=1; j<length; j++) {
								String m_string = n_string.substring(j) + n_string.substring(0, j);
								int m = Integer.parseInt(m_string);
								if (m>n && m<=b) {
									recycled.add(n_string + ", " + m_string);
								}
							}
						}
						System.out.println("Case #" + i + ": " + recycled.size());
					}
				} else {
					System.out.println("ERROR: Could not read the test case #" + i);
				}
			}
		} catch (FileNotFoundException e) {
			System.out.println("ERROR: FileNotFoundException for the input file.");
			e.printStackTrace();
		} finally {
	        input.close();
		}
	}

}
