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

import java.io.File;
import java.io.FileNotFoundException;
import java.io.PrintStream;

import common.FileTranslatorBasis;

public class C {

	final static int[] digitNum = { 9, 99, 999, 9999, 99999, 999999, 9999999 };
	int low;
	int high;

	int pow = 1;

	public C(String low, String high) {

		for (int i = 0; i < low.length() - 1; i++) {
			pow = 10 * pow;
		}
		this.low = Integer.parseInt(low);
		this.high = Integer.parseInt(high);
	}

	long count;
	int[] map = new int[2000001];

	public void initMap() {
		int[] tmp = { 1, 11, 111, 1111, 11111, 111111, 1111111, 2, 22, 222,
				2222, 22222, 222222, 3, 33, 333, 3333, 33333, 333333, 4, 44,
				444, 4444, 44444, 444444, 5, 55, 555, 5555, 55555, 555555, 6,
				66, 666, 6666, 66666, 666666, 7, 77, 777, 7777, 77777, 777777,
				8, 88, 888, 8888, 88888, 888888, 9, 99, 999, 9999, 99999,
				999999, };
		for (int i : tmp) {
			map[i] = -1;
		}
	}

	/**
	 * 
	 * @param in
	 */
	private void parse(int in) {
		int pair = 1;

		if (map[in] == -1) {
			return;
		}
		map[in]=-1;
		String inStr = String.valueOf(in);
		char[] chars = inStr.toCharArray();
		for (int i = 0; i < chars.length - 1; i++) {
			in = (in - (chars[i] - 48) * pow) * 10 + (chars[i] - 48);
			if (valid(in)) {
				if (map[in] != -1) {
					pair++;
					map[in] = -1;
				}
			}
		}
		count += pair * (pair - 1) / 2;
	}

	public long count() {
		for (int i = low; i <= high; i++) {
			parse(i);
		}
		return count;
	}

	private boolean valid(int t) {
		return t >= low && t <= high;
	}

	public static void main(String[] args) throws FileNotFoundException {

		System.setOut(new PrintStream(new File("output.txt")));

//		String fname = "sample.txt";
		String fname = "C-small-attempt0.in.txt";
//		String fname = "C-large.in.txt";
		FileTranslatorBasis ftb = FileTranslatorBasis.getInstance(fname);

		int num = ftb.getNumOfCase();
		for (int i = 0; i < num; i++) {
			String[] input = ftb.getStrDataArray();
			C c = new C(input[0],input[1]);
			System.out.println("Case #" + Integer.toString(i + 1) + ": "
					+ String.valueOf(c.count()));

		}

	
	}
}
