/*
 * 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 org.apache.commons.io.IOUtils;

import java.io.*;
import java.util.Scanner;
import java.util.HashMap;
import java.util.List;
import java.util.ArrayList;

public class RecycledNumbers {
    private static int[][] testCases = null;
    private static int numTestCases;
    private static HashMap<String, String> visitedNumbers;

    public static void main(String[] args) throws IOException {
        change();
        if (true)
            return;

        readInput();
        visitedNumbers = new HashMap<String, String>();

        PrintWriter out = new PrintWriter(new FileWriter("D:\\amir\\codejam\\out.txt"));
        for (int i = 0; i < numTestCases; i++)
        {
            int count = countRecycled(testCases[i][0], testCases[i][1]);
            int m = i + 1;
            out.write("Case #" + m + ": " + count);
            out.println();
            System.out.println(count);
        }

        out.flush();
        out.close();
    }

    public RecycledNumbers() {
    }

    private static void change() throws IOException {
          InputStream inputStream = new FileInputStream("D:\\amir\\codejam\\out.txt");
          StringWriter writer = new StringWriter();
          IOUtils.copy(inputStream, writer);
          String theString = writer.toString();
          theString = theString.replaceAll(" Case", "\nCase");
        
          System.out.println(theString);
          
    }
    private static void readInput() throws IOException {
        InputStream inputStream = new FileInputStream("D:\\amir\\codejam\\csmall22.txt");
        Scanner scanner = new Scanner(inputStream);

        numTestCases = scanner.nextInt();
        testCases = new int[numTestCases][2];
        for (int i = 0; i < numTestCases; i++) {
            testCases[i][0] = scanner.nextInt();
            testCases[i][1] = scanner.nextInt();
        }

        inputStream.close();
    }

    private static Integer[] getNewNumbers(int n) {
        if (n < 1
//                || visitedNumbers.get(n) != null
                )
            return null;

        String aStr = String.valueOf(n);
        int c = 0;
        if (aStr.length() > 1) {
            char[] chs = aStr.toCharArray();
            for (int i = 0; i < aStr.toCharArray().length - 1; i++)
                if (chs[i] == chs[i+1])
                    c++;
        }
        if (c == aStr.length() - 1)
            return null;

        Integer[] newNumbers = new Integer[aStr.length() - 1];

        for (int i = 0; i < aStr.length() - 1; i++) {
            String rec = getRecycled(i + 1, aStr);
            if (rec == null) {
                newNumbers[i] = null;
                continue;
            }
            newNumbers[i] = Integer.valueOf(rec);
        }

        return newNumbers;
    }

    static int countRecycled(int n, int m) {
        int count = 0;
        for (int i = n; i <= m; i++) {
            Integer[] newNumbers = getNewNumbers(i);
            if (newNumbers == null)
                continue;

            for (int j = 0; j < newNumbers.length; j++) {
                if (newNumbers[j] == null)
                    continue;

                if (newNumbers[j] <= m) {

                    if (i == 111)
                        System.out.println("");

                    String v1 = visitedNumbers.get(newNumbers[j] + "-" + i);

                    if (v1 == null)
                        count++;

                    visitedNumbers.put(i + "-" + newNumbers[j], "" + newNumbers[j]);
                    System.out.println(i + "-" + newNumbers[j]);
                }
            }
        }

        return count;
    }

    private static String getRecycled(int index, String number) {
        String num1 = number.substring(0, index);

        String num2 = number.substring(index, number.length());

//        if (num1.equals(num2))
//            return null;

        String str = num2 + num1;

//        if (str.startsWith("0"))
//            return null;
        
        return str;
    }
}
