/*
 * 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();

    }

}

/*
 * To change this template, choose Tools | Templates
 * and open the template in the editor.
 */
package googlecodejam;

import java.io.BufferedReader;
import java.io.BufferedWriter;
import java.io.FileInputStream;
import java.io.FileNotFoundException;
import java.io.FileWriter;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.ArrayList;
import java.util.Collections;
import java.util.HashMap;
import java.util.HashSet;
import java.util.List;
import java.util.Set;

/**
 *
 * @author Wouter
 */
public class RecycledNumbers {

    ArrayList<String> cases = new ArrayList<String>();

    public RecycledNumbers() {


        try {
            // Setup in/out
            System.setIn(new FileInputStream("C:\\GCJ\\C-small-attempt0.in"));
            BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
            BufferedWriter bw = new BufferedWriter(new FileWriter("C:\\GCJ\\C-small-attempt0.out"));
            bw.flush();



            int untill = Integer.parseInt(br.readLine());

            for (int x = 1; x <= untill; x++) {
                int ans = 0;
                String[] s = br.readLine().split(" ");
                int a = Integer.parseInt(s[0]);
                int b = Integer.parseInt(s[1]);

                for (int z = a; z <= b; z++) {
                    List<Integer> ints = getAllRecycledPairsOf(z);
                    removeDups(ints);
                    Collections.sort(ints);

                    for (Integer nr : ints) {
                        if (between(nr, a, b)) {
                            ans++;
                        } else if (nr > b) {
                            break;
                        }
                    }
                }

                String out = "Case #" + x + ": " + ans;

                cases.add(out);

            }

            for (String s : cases) {
                System.out.println(s);
                bw.write(s);
                bw.flush();
                bw.newLine();
            }

        } catch (IOException ex) {
            System.out.println("SOMETHING WENT WRONG");
        }

    }

    public List<Integer> getAllRecycledPairsOf(int nr) {
        List<Integer> ints = new ArrayList<Integer>();

        StringBuilder s = new StringBuilder();
        s.append(nr);

        String start = s.toString();

        for (int x = 1; x < start.length(); x++) {
            s = new StringBuilder();
            String back = start.substring(start.length() - x, start.length());
            String front = start.substring(0, start.length() - x);
            s.append(back).append(front);
            if (!back.startsWith("0")) {
                Integer newNr = new Integer(s.toString());
                if (newNr > nr) {
                    ints.add(newNr);
                }
            }
        }

        return ints;
    }

    public static void main(String[] args) {
        RecycledNumbers test = new RecycledNumbers();
    }

    public boolean between(int nr, int a, int b) {
        if (nr >= a && nr <= b) {
            //System.out.println(nr);
            return true;
        }
        return false;
    }

    public static void removeDups(List<Integer> list) {
        Set<Integer> s = new HashSet<Integer>(list);
        list.clear();
        list.addAll(s);
    }
}
