/*
 * 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.File;
import java.io.FileNotFoundException;
import java.util.HashSet;
import java.util.Scanner;
import java.util.Set;

public class RecycledNumbers {

	private static int numberOfRecycledPairsPossible(int a, int lowerLimit,
			int upperLimit) {
		int length = (a + "").length();
		if (length == 1) {
			return 0;
		}

		int[] digits = new int[length];
		int b = a;
		boolean isRecyclePossible = false;
		int temp = 0;
		;
		Set<String> set = new HashSet<String>();

		digits[length - 1] = b % 10;
		b /= 10;

		for (int i = length - 2; i >= 0; i--) {
			digits[i] = b % 10;
			b /= 10;
			if (digits[i] != digits[i + 1]) {
				isRecyclePossible = true;
			}
		}
		if (!isRecyclePossible) {
			return 0;
		}

		for (int i = 1; i < length; i++) {
			temp = 0;
			for (int j = i; j < length; j++) {
				temp = temp * 10 + digits[j];
			}
			for (int j = 0; j < i; j++) {
				temp = temp * 10 + digits[j];
			}
			if (temp <= upperLimit && temp >= lowerLimit && temp > a) {
				set.add(a + "" + temp);
			}
		}
		return set.size();
	}

	private static int getRecycledNumbers(int start, int end) {
		int count = 0;
		for (int i = start; i <= end; i++) {
			count += numberOfRecycledPairsPossible(i, start, end);
		}
		return count;
	}

	public static void main(String[] args) throws FileNotFoundException {
		File file = new File("d:\\codeJam\\Numbers\\test.txt");
		Scanner scanner = new Scanner(file);
		int t = scanner.nextInt();
		int count = 0;
		for (int i = 1; i <= t; i++) {
			count = getRecycledNumbers(scanner.nextInt(), scanner.nextInt());
			System.out.println("Case #" + i + ": " + count);
		}
	}
}
