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

}

package com.google;

import java.io.BufferedReader;
import java.io.BufferedWriter;
import java.io.File;
import java.io.FileReader;
import java.io.FileWriter;

public class RecycledNumbers {

	public static void main(String[] args) throws Exception{
		RecycledNumbers s = new RecycledNumbers();
		s.solve();
		
	}
	public void solve() throws Exception
	{
		int lines = Integer.parseInt(readLine());
		for(int i=0;i<lines;i++)
		{
			String line = readLine();
			if(line == null)
				break;
			String[] comps = line.split(" ");
			int A = Integer.parseInt(comps[0]);
			int B = Integer.parseInt(comps[1]);
			int count = 0;
			
			for(int j=A;j<=B;j++)
			{
				boolean[] a = new boolean[2000001];
				String n = Integer.toString(j);
				for(int k=0;k<n.length()-1;k++)
				{
					n =  n.charAt(n.length()-1) + n.substring(0,n.length()-1);
					String n2 = n;
					while(n2.charAt(0) == '0')
					{
						if(n2.length() == 0)
							break;
						n2 = n2.substring(1,n2.length());
					}
					int n1 = Integer.parseInt(n2);
					if(n1 < A || n1 > B || n1 <= j)
						continue;

					if(!a[n1])
					{
						count++;
						a[n1] = true;
					}
				}
			}
			if(i == lines-1)
				writeLine("Case #" + (i+1) + ": " + count);
			else
				writeLine("Case #" + (i+1) + ": " + count + "\n");
		}
		o.close();
	}
	BufferedReader f = null;
	public String readLine() throws Exception
	{
		if(f == null)
			f = new BufferedReader(new FileReader(new File("C:\\Users\\raj617\\workspace\\srm\\dat\\C-small-attempt0.in")));
		return f.readLine();
	}
	BufferedWriter o = null;
	public void writeLine(String line) throws Exception
	{
		if(o == null)
			o = new BufferedWriter(new FileWriter(new File("C:\\Users\\raj617\\workspace\\srm\\dat\\out.txt")));
		o.write(line );
		o.flush();
	}
}
