/*
 * 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.BufferedReader;
import java.io.BufferedWriter;
import java.io.File;
import java.io.FileReader;
import java.io.FileWriter;
import java.util.Arrays;
import java.util.HashSet;

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

/**
 *
 * @author Alex
 */
public class Recycle {
    private class Data {
        public int A;
        public int B;
        public HashSet<String> list;
        
        public Data(String s) {
            String[] parts = s.trim().split(" ");
            A = Integer.parseInt(parts[0]);
            B = Integer.parseInt(parts[1]);
            list = new HashSet<String>();
        }
        
        public Data(int n_) {
        
        }
        
        public int Solve() {
            list.clear();
            int sols = 0;
            for (int i=A;i<=B;i++) {
                sols += permutate(i);
                //sols += countPerms(i);
            }
            //System.out.println(sols);
            if (sols != list.size())
                System.err.println("WTF");
            return list.size();
        }
        
        public int permutate(int i) {
            int count = 0;
            int c = i;
            int length = (int)(Math.log10(i)+1);
            int power = length-1;
            //System.out.println("Length: "+length);
            for (int h=0;h<power;h++) {
                int ones = c%10;
                int rest = c/10;
                //System.out.println("ones: "+ones);
                //System.out.println("rest: "+rest);
                c = (int)((c%10)*Math.pow(10,power)) + c/10;
                if (ones != 0 && !(""+c).replaceAll(""+ones, "").equals("") && c <= B && c > i && i >= A) {
                    count++;
                    //System.out.println(""+i+": "+c);
                    //System.out.println("Counts");
                    list.add(""+i+""+c);
                }
            }
            //System.out.println(list.size());
            return count;
        }
    }
    
    private static String IN = ".\\C-small-attempt2.in";
    private static String OUT = ".\\C-small-attempt2.out";
    
    private Data[] datas;
    
    private void go() {
        File file = new File(IN);
        System.out.println(file.getAbsolutePath());
        File fo = new File(OUT);
        try {
            if (!fo.createNewFile()) {
                fo.delete();
                fo.createNewFile();
            }
            BufferedReader br = new BufferedReader(new FileReader(file));
            BufferedWriter bw = new BufferedWriter(new FileWriter(fo));
            String line;
            int num = Integer.parseInt(br.readLine());
            datas = new Data[num];
            int i = 0;
            while ((line = br.readLine()) != null && num-->0) {
                datas[i] = new Data(line);
                int solv = datas[i].Solve();
                String ss = "Case #"+(i+1)+": "+solv+"\n";
                System.out.print(ss);
                bw.write(ss);
                i++;
            }
            br.close();
            bw.close();
        } catch (Exception e) {
            e.printStackTrace();
        }
    }
    
    public Recycle() {
        go();
    }
    
    public static void main(String[] args) {
        new Recycle();
    }
}
