/*
 * 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.File;
import java.io.FileReader;
import java.io.FileWriter;
import java.util.ArrayList;

public class ProblemC {

	/**
	 * @param args
	 */
	public static void main(String[] args) {
		BufferedReader br = null;
		BufferedWriter bw = null;
		String input = null;
		StringBuffer output = null;
		String[] twonumbers = null;
		int min = 0, max = 0;
		ArrayList<String> list = null;
		String temp = null;
		String strmin = "";
		int tempint = 0;
		int counter = 0;
		int digit1 = 0, digit2 = 0;
		try {
			br = new BufferedReader(new FileReader(new File(
					"C:/Users/DHAVAL/Downloads/Input1.txt")));
			bw = new BufferedWriter(new FileWriter("output1.txt"));
			int count = Integer.parseInt(br.readLine());
			for (int i = 0; i < count; i++) {
				input = br.readLine();
				output = new StringBuffer("Case #" + (i + 1) + ": ");
				counter=0;
				// logic here
				list = new ArrayList<String>();
				twonumbers = input.split(" ");
				min = Integer.parseInt(twonumbers[0]);
				max = Integer.parseInt(twonumbers[1]);
				if (max >= 10) {
					for (int j = min; j <= max; j++) {
						strmin = "" + j;
						temp = strmin;
						for (int k = 0; k < strmin.length() - 1; k++) {
							temp = temp.substring(1) + temp.charAt(0);
							tempint = Integer.parseInt(temp);
							digit1 = ("" + tempint).length();
							digit2 = strmin.length();
							if (j < tempint && digit1 == digit2
									&& tempint >= min && tempint <= max
									&& !list.contains(strmin + "||" + temp)
									&& !temp.equals(strmin)) {
								//System.out.println(strmin + " " + tempint);
								// list.add(temp);
								list.add(strmin + "||" + temp);
								counter++;
							}
						}
					}
				}
				bw.write(output.toString() + counter);
				bw.newLine();
			}
			bw.close();
		} catch (Exception e) {
			e.printStackTrace();
		}

	}

}
