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

public class codejam1{

    public static void main(String [] args){
        HashMap<Integer, Integer> permuToPairs = new HashMap<Integer, Integer>();
        permuToPairs.put(1,0);
        permuToPairs.put(2,1);
        permuToPairs.put(3,3);
        permuToPairs.put(4,6);
        permuToPairs.put(5,10);
        permuToPairs.put(6,15);
        permuToPairs.put(7,21);
        //System.out.println(findRecycle(1111, 2222,permuToPairs));
        int count = 1;
        try{
            Scanner sc = new Scanner(new File("C-small-attempt0.in"));
            PrintStream ps = new PrintStream(new File("OutputFile"));
            sc.nextLine();
            while (sc.hasNextLine()){
                String line  = sc.nextLine();
                String[] numbers = line.split(" ");
                long low = Long.parseLong(numbers[0]);
                long high = Long.parseLong(numbers[1]);
                
                String s = "Case #"+count+": " + findRecycle(low, high,permuToPairs);
                if(sc.hasNextLine()){
                    s +="\n";
                }
                ps.print(s);
                count ++;
            }
        }catch(Exception e){
            
        }
    }   
    
    public static long findRecycle(long low, long high, HashMap<Integer, Integer> permuToPairs){
        Set<Long> numberSet = new HashSet<Long>();
        String numberString = low+"";
        int numWidth = numberString.length();
        long count = 0;
        for(long i = low; i<= high; i++){
            if(!numberSet.contains(i)){
                numberSet.add(i);
                long permuNumber = i;
                int numPermus = 1;
                for(int j = 0; j < numWidth; j++){
                    // permute the number
                    permuNumber = permuNumber % 10* (int)Math.pow(10, numWidth-1)+permuNumber/10;
                    if(permuNumber >= low && permuNumber <= high && !numberSet.contains(permuNumber)){
                        numPermus++;
                        numberSet.add(permuNumber);
                    }
                }
                count += permuToPairs.get(numPermus);
            }
        }
        return count;
        
    }
}