/*
 * To change this template, choose Tools | Templates
 * and open the template in the editor.
 */

package year_2012.qualification;

import java.io.BufferedReader;
import java.io.File;
import java.io.FileNotFoundException;
import java.io.FileReader;
import java.io.IOException;
import java.io.PrintWriter;
import java.util.HashSet;
import java.util.Set;

/**
 *
 * @author paul
 * @date 14 Apr 2012
 */
public class QuestionC {

    private static Set<Integer> getCycle(int x) {

        String s = Integer.toString(x);
        Set<Integer> set = new HashSet<Integer>();
        set.add(x);
        for (int c = 1; c < s.length(); c++) {
            String t = s.substring(c).concat(s.substring(0, c));
            set.add(Integer.parseInt(t));
        }
        return set;
        
    }

    private static Set<Integer> mask(Set<Integer> set, int a, int b) {
        Set<Integer> result = new HashSet<Integer>();

        for (int x : set) {
            if (x >= a && x <= b) {
                result.add(x);
            }
        }
        
        return result;

    }


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

        String question = "C";

//        String name = "large";
        String name = "small-attempt0";
//        String name = "test";

        String filename = String.format("%s-%s", question, name);

        BufferedReader input = new BufferedReader(
                new FileReader(String.format("/home/paul/Documents/code-jam/2012/qualification/%s.in",
                filename)));

        String firstLine = input.readLine();

        PrintWriter pw = new PrintWriter(new File(
                String.format("/home/paul/Documents/code-jam/2012/qualification/%s.out", filename)));


        int T = Integer.parseInt(firstLine);

        // Loop through test cases.
        for (int i = 0; i < T; i++) {

//             Read data.
            String[] tokens = input.readLine().split(" ");

//            int N = Integer.parseInt(input.readLine());

            int A = Integer.parseInt(tokens[0]);
            int B = Integer.parseInt(tokens[1]);

//            System.out.format("%d, %d\n", A, B);

            boolean[] used = new boolean[B+1];
            int total = 0;
            for (int n = A; n <= B; n++) {
                if (!used[n]) {
                    Set<Integer> set = mask(getCycle(n), A, B);
                    int k = set.size();
                    total += (k * (k-1))/2;
                    for (int m : set) {
                        used[m] = true;
                    }
                }
            }

            pw.format("Case #%d: %d\n", i + 1, total);
        }

        pw.close();

    }

}

import java.io.FileNotFoundException;
import java.io.FileReader;
import java.io.FileWriter;
import java.io.IOException;
import java.io.PrintWriter;
import java.util.ArrayList;
import java.util.HashSet;
import java.util.LinkedHashSet;
import java.util.Scanner;
import java.util.Set;
import java.util.regex.Pattern;


public class ProblemC {

	public static void main(String[] args) {

		Scanner input;
		try {
			input = new Scanner(new FileReader("C-small-attempt0.in"));
			PrintWriter output = new PrintWriter(new FileWriter("output3.txt"));

			int numberCases = input.nextInt();
			String data = input.nextLine();

			for (int i = 0; i < numberCases; i++) {
				output.print("Case #" + (i + 1) + ": ");

				data = input.nextLine();
				String[] intS = Pattern.compile(" ").split(data);
				int[] numbers = new int[intS.length];
				for (int j = 0; j < intS.length; j++) {
					numbers[j] = Integer.parseInt(intS[j]);
				}

				int lowerBound = numbers[0];
				int upperBound = numbers[1];
				output.print(calculatePossibilities(lowerBound, upperBound));
				output.print("\n");
			}

			output.flush();
			output.close();
			input.close();
		} catch (FileNotFoundException e) {
			e.printStackTrace();
		} catch (IOException e) {
			e.printStackTrace();
		}
	}

	public static int calculatePossibilities(int lowerBound, int upperBound) {

		Set allPossibilities = new HashSet();
		int numberDigits = (int) (Math.floor(Math.log10(lowerBound))) + 1;
		int currentNumber = 0;
		int lowPart = 0;
		int highPart = 0;
		//System.out.println("Digits " + numberDigits);
		for (int j = lowerBound; j <= upperBound; j++) { 
			Set permutations = new HashSet();
			for (int i = 1; i <= numberDigits - 1; i++) {
				lowPart = j % ((int) Math.pow(10, i));
				highPart = j / ((int) Math.pow(10, i));
				currentNumber = (lowPart * (int) Math.pow(10, numberDigits - i)) + highPart;
				//System.out.println(currentNumber + " <- j: " + j + " i:" + i + "  low " + lowPart + " high " + highPart);
				
				if (currentNumber >= lowerBound && currentNumber <= upperBound &&
						currentNumber > j) {
					permutations.add(currentNumber);

				}
				if (!permutations.isEmpty())
					allPossibilities.add(permutations);
			}
		}

		//System.out.println("A: " + allPossibilities.size());
		return allPossibilities.size();
	}
}
