/*
 * 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.BufferedReader;
import java.io.BufferedWriter;
import java.io.DataInputStream;
import java.io.File;
import java.io.FileInputStream;
import java.io.FileWriter;
import java.io.InputStreamReader;
import java.util.ArrayList;
import java.util.HashSet;


public class MainImpl {

	public static int numberOfLines;
	
	public static int firstNumber;
	
	public static int secondNumber;
	
	public static ArrayList<String> eachLine = new ArrayList<String>();
	
	public static void main(String[] args) {

		readFile();
		for (int i = 1; i<= numberOfLines ; i++) {
			findSets(eachLine.get(i - 1), i);
		}
		System.out.print("Done with conversion");
	}
	
	public static void findSets(String line, int index) {
		StringBuffer buffer = new StringBuffer();
		buffer.append("Case #").append(index).append(": ");
		
		int totalUniqueCases = 0;
		String[] numbers = line.split(" ");
		
		String firstNumberString = numbers[0];
		String secondNumberString = numbers[0];
		
		firstNumber = Integer.parseInt(numbers[0]);
		secondNumber = Integer.parseInt(numbers[1]);
		
		if (firstNumber > secondNumber) {
			buffer.append(String.valueOf(totalUniqueCases));
			writeToFile(buffer.toString());
			return;
		}
		
		if (firstNumberString.length() == 1 && (secondNumberString.length() == 1)) {
			buffer.append(String.valueOf(totalUniqueCases));
			writeToFile(buffer.toString());
			return;
		}
		
		int numberBeingConsidered = firstNumber;
		
		int totalNumberOfSets = 0;
		
		while (numberBeingConsidered <= secondNumber) {
			
			totalNumberOfSets = totalNumberOfSets + findPermutations(numberBeingConsidered);
			numberBeingConsidered++;
		}
		buffer.append(String.valueOf(totalNumberOfSets));
		writeToFile(buffer.toString());
	}
	
	public static int findPermutations(int numberBeingConsidered) {
		
		int validPermutations = 0;
		
		String numberBeingConsideredString = String.valueOf(numberBeingConsidered);
		
		ArrayList<String> possiblePermutaions = new ArrayList<String>();
		
		for (int i = numberBeingConsideredString.length() - 1; i>=1; i--) {
			
			String permutationString = numberBeingConsideredString.substring(i) + numberBeingConsideredString.substring(0, i);
			
			if (!numberBeingConsideredString.equals(permutationString) && (!possiblePermutaions.contains(permutationString))) {
				
				int permutationNumber = Integer.parseInt(permutationString);
				
				if ((firstNumber <= numberBeingConsidered) && (numberBeingConsidered < permutationNumber) && (permutationNumber <= secondNumber)) {
					validPermutations++;
					possiblePermutaions.add(permutationString);
				}
				
			}
		}
		return validPermutations;
	}
	
	public static void readFile() {
		try {
			FileInputStream fstream = new FileInputStream("src/input.txt");
			DataInputStream in = new DataInputStream(fstream);
			BufferedReader br = new BufferedReader(new InputStreamReader(in));
			String strLine;
			numberOfLines = Integer.parseInt(br.readLine());
			while ((strLine = br.readLine()) != null) {
				eachLine.add(strLine);
			}
			in.close();
		} catch (Exception e) {
			System.err.println("Error: " + e.getMessage());
		}
	}
	
	public static void writeToFile(String line) {
		try {
			BufferedWriter bw = new BufferedWriter(new FileWriter(new File(
					"src/output.txt"), true));
			bw.write(line);
			bw.newLine();
			bw.close();
		} catch (Exception e) {
			System.out.println("Error occured " + e);
		}

	}
}
