/*
 * 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.example;

import java.io.IOException;
import java.util.List;

public class ProblemC {

    static int[] data = new int[2000001];

    public static void main(String[] a) throws IOException {
	
//	if(true) {
//	    precalc();
//
////	    System.out.println("min = "+ findMinimum(3210));
//	    
//	    return;
//	}
	
	List<String> lines = FileUtil.getLines("/C-small-attempt0.in");
	
	for(int i=1; i<data.length; i++) {
	    data[i] = findMinimum(i);
	}
	
	int cases = Integer.valueOf(lines.get(0));
	
	for(int i=0; i<cases; i++) {

	    String[] tokens = lines.get(i+1).split(" ");
	    
	    Integer start = Integer.valueOf(tokens[0]);
	    Integer stop = Integer.valueOf(tokens[1]);
	    
	    System.out.println("Case #"+ (i+1) +": "+ test(start, stop));
	}
    }
    
    static int test(int a, int b) {
	int found = 0;
	
	for(int n=a; n<b; n++) {
	    for(int m=n+1; m<=b; m++) {
		
		boolean equals = (data[n] == data[m]);
		
		if(equals) {
		    found++;
		}
	    }
	}
	
	return found;
    }
    
    static int findMinimum(int i) {
	int numDigits = (int) (1+Math.log10(i));
	
	int min = i;
	
	for(int r=0; r<numDigits-1; r++) {
	    int rotated = rotateInt(i, r);
	    int numDigitRotated = (int) (1+Math.log10(rotated));
	    
	    if(numDigits == numDigitRotated && rotated < min) {
		min = rotated;
	    }
	}

	return min;
    }
    
    static int rotateInt(int i, int r) {
	int tailPow = pow(10, 1+r);
	int tail = i % tailPow;
	
	return (i/tailPow) + tail * pow(10, (int) Math.log10(i) - r);
    }
    
    static int pow(int a, int b) {
	int r = 1;
	
	for(int i=0; i<b; i++) {
	    r *= a;
	}
	
	return r;
    }
}
