/*
 * 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.File;
import java.io.FileReader;
import java.io.IOException;
import java.util.LinkedList;
import java.util.Scanner;

public class Main {
	public static void main(String[] args) throws IOException {
		LinkedList<String> list = readFile("C:/Users/Wurschti/workspace2/2012_3_recycled/src/input.txt");
		int counter = 1;
		int result = 0;
		LinkedList<Pair> resultList = new LinkedList<Pair>();

		for (String s : list) {
			resultList = new LinkedList<Pair>();
			String[] pair = s.split(" ");
			if (pair.length < 2) {
				result = 0;
			} else {
				int min = Integer.parseInt(pair[0]);
				int max = Integer.parseInt(pair[1]);
				
				int counter2 = min;
				while (counter2 < max) {
					String intToUse = counter2 + "";
					for (int i = 0; i < intToUse.length(); i++) {
						char[] intAsCharArray = intToUse.toCharArray();
						for (int j = 0; j < intAsCharArray.length - 1; j++) {
							intAsCharArray[j] = intAsCharArray[j + 1];
						}
						intAsCharArray[intAsCharArray.length - 1] = intToUse.charAt(0);
						
						intToUse = "";
						for (char c : intAsCharArray) {
							intToUse += c;
						}
						
						//evtl contains umschreiben
						int resultNumber = Integer.parseInt(intToUse);
						Pair p = new Pair(counter2, resultNumber);
						if (!isIn(p, resultList) && resultNumber <= max && resultNumber > counter2) {
							resultList.add(p);
						}
						
					}
					
					counter2++;
				}
			}
			
		
			
			System.out.format("Case #%d: %s\n", counter, resultList.size());
			counter++;
		}
	}
	
	private static boolean isIn(Pair p, LinkedList<Pair> list) {
		for (Pair p2 : list) {
			if (p.first == p2.first && p.second == p2.second) {
				return true;
			}
		}
		return false;
	}
	
	
	public static LinkedList<String> readFile(String filename)
			throws IOException {
		LinkedList<String> list = new LinkedList<String>();
		File file = new File(filename);

		if (!file.exists()) {
			System.out.println("file not found");
			return null;
		}

		BufferedReader in = new BufferedReader(new FileReader(file));

		// read vocables
		String input = in.readLine();
		input = in.readLine();

		while (input != null) {
			list.add(input);
			input = in.readLine();
		}

		in.close();
		return list;
	}
}
