/*
 * 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.BufferedWriter;
import java.io.IOException;
import java.util.ArrayList;
import java.io.FileNotFoundException;
import java.io.FileReader;
import java.io.FileWriter;
import java.util.Scanner;
import javax.swing.JOptionPane;

public class Pair
{
    private int A;
    private int B;
    private int pairs;

    public Pair(int A, int B)
    {
        this.A = A;
        this.B = B;
        this.pairs = 0;
    }

    public int getA()
    {
        return this.A;
    }

    public int getB()
    {
        return this.B;
    }

    public int getPairs()
    {
        return this.pairs;
    }

    public String snake(String the_string, int position)
    {
        int len = the_string.length();
        int point = len - position;
        String end = the_string.substring(point);
        String build = end + the_string.substring(0, point);
        return build;
    }

    public void finder(int base, int limit)
    {
        ArrayList<String> doubles = new ArrayList<String>();
        String the_base = Integer.toString(base);
        int len = the_base.length();

        for(int i = 1; i < len; i++)
        {
            String answ = this.snake(the_base, i);

            if(!doubles.contains(answ))
            {
                int answer = Integer.parseInt(answ);

                if(answer <= limit && base < answer)
                {
                    doubles.add(answ);
                    this.pairs++;
                }
            }
        }
    }

    public void find_pairs()
    {
        int the_A = this.A;

        while(the_A < this.B)
        {
            this.finder(the_A, this.B);
            the_A++;
        }
    }

    public static void main(String[] args) throws FileNotFoundException, IOException
    {
        String file = JOptionPane.showInputDialog("Enter the name of the file you wish to use.");
        Scanner in = new Scanner(new FileReader(file));
        FileWriter fstream = new FileWriter("out.txt");
        BufferedWriter out = new BufferedWriter(fstream);

        String integ = in.nextLine();
        int cases = Integer.parseInt(integ);

        for(int i = 0; i < cases; i++)
        {
            String ab = in.nextLine();
            Scanner abs = new Scanner(ab);
            String a = abs.next();
            String b = abs.next();
            int int_a = Integer.parseInt(a);
            int int_b = Integer.parseInt(b);

            Pair current = new Pair(int_a, int_b);
            current.find_pairs();

            System.out.println("Case #" + (i + 1) + ": " + current.getPairs());

            out.write("Case #" + (i + 1) + ": " + current.getPairs() + "\r\n");
        }
        out.close();
    }
}
