/*
 * 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.BufferedWriter;
import java.io.FileReader;
import java.io.FileWriter;
import java.util.HashSet;

public class ProblemB {

	BufferedReader input;
	BufferedWriter output;

	public static void main(String[] args) {
		(new ProblemB()).solve();
	}

	private void solve() {
		try {
			input = new BufferedReader(new FileReader("E://Technical/eclipse/workspace/CodeJam2012/input/C-small-attempt0.in"));
			output = new BufferedWriter(new FileWriter("E://Technical/eclipse/workspace/CodeJam2012/output/problemB.out"));

			int T = Integer.parseInt(input.readLine());

			for(int i=0; i < T; i++) {

				String[] t = input.readLine().split(" ");

				long A = Long.parseLong(t[0]);
				long B = Long.parseLong(t[1]);

				long y = 0;
				HashSet o = new HashSet();

				for(long j = A; j <= B; j++) {
					if(j>9) calculate(j, A, B,o);
				}

				y = o.size() / 2;
				output.write("Case #" + (i + 1) + ": " + y + "\n");
			}

			output.flush();
			System.out.println("completed");
		} catch (Exception ex) {
			ex.printStackTrace();
		}		
	}

	public void calculate(long number, long A, long B, HashSet o)
	{
		long y = 0;
		long t = number;

		int n = (int) Math.log10((double)number);
		int m = (int) Math.pow(10.0, (double)n);
		
		while(true)
		{
			long r = number % 10;

			number = number / 10;
			number = number + m * r;

			if(number != t && number >= A && number <= B) {
				o.add(t+":"+number);
				o.add(number+":"+t);
			}

			if(number == t)
				break;
		}
	}	
}
