/*
 * 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.*;
import java.util.*;

public class Q3 {
    public static void main(String[] args) {
        Q3 q = new Q3();
        //System.out.println(q.calculate(10, 2000000));
        //q.test();
        q.answerSmall();
        //q.answerLarge();
    }
    
    public void answerSmall(){
        read("C-small-attempt0.IN", "Q3_small_output.txt");
    }
    
    public void answerLarge(){
        read("C-large.IN", "Q3_large_output.txt");
    }
    
    public void test(){
        read("Test3_input.txt", "Test3_output.txt");
    }
    
    public void read(String readFrom, String writeTo){
        try{
            Scanner in = new Scanner(new File(readFrom));
            File f = new File(writeTo);
            FileWriter fw = new FileWriter(f);
            int T = Integer.parseInt(in.nextLine());
            int A, B;
            String[] input;
            String answer;
            
            for(int i = 1; i <= T; i++) {
                input = in.nextLine().split(" ");
                A = Integer.parseInt(input[0]);
                B = Integer.parseInt(input[1]);
                
                answer = "" + calculate(A, B);
                if(i + 1 <= T)
                    answer += "\r\n";
                fw.write("Case #" + i + ": " + answer);
                
            }
            
            
            fw.close();
        }catch(Exception ex) {
            System.out.println(ex);
        }
    }
    
    public int calculate(int A, int B) {
        int num = 0, m;
        String hold;
        ArrayList<Integer> distinct = new ArrayList<Integer>();
        for(int n = A; n <= B; n++) {
            if(n > 10) {
                hold = "" + n;
                distinct.clear();
                for(int i = 1; i < hold.length(); i++) {
                    m = Integer.parseInt((hold.substring(i) + hold.substring(0,i)));
                    if(m <= B && n < m && !distinct.contains(m)) {
                        distinct.add(m);
                        num++;
                    }
                }
            }
        }
        return num;
    }
}
