/*
 * 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 C {
    BufferedReader ins;
    PrintStream outs;

    static String INPUT = "C-small-attempt0.in";
    static String OUTPUT;

    static {
        OUTPUT = "C.out";
    }

    Map<String, Set<String>> map = new HashMap<String, Set<String>>();
    
    public C(BufferedReader ins, PrintStream outs) {
        this.ins = ins;
        this.outs = outs;
    }

    public void preprocess() {
        for(int j = 1; j<=2000000; j++) {
            String k = new Integer(j).toString();
            Set<String> set = new HashSet<String>();
            int sz = k.length();
            for(int i = 1; i<sz; i++) {
                set.add(k.substring(i) + k.substring(0,i));
            }
            map.put(k, set);
        }
    }
    
    public int permuteK(int k, int b) {
        int sz = new Integer(b).toString().length();
        int ret = 0;

        Set<String> set = new HashSet<String>();
        for(int i = 0; i<sz; i++) {
            String x = new Integer(k).toString();
            String sb = x.substring(i) + x.substring(0,i);
            
            assert(sb.length() == sz);
            
            int newk = Integer.parseInt(sb);
            if(newk > k && newk <=b) {
                if(!set.contains(x+"-"+sb)) {
                    set.add(x+"-"+sb);
                }
                ret++;
            }
        }
        return set.size();
    }
   
    public int permuteL(int k, int b) {
        String m = new Integer(k).toString();
        int count = 0;
        for(String r : map.get(m)) {
            int newk = Integer.parseInt(r);
            if(newk>k && newk<=b) count++;
        }
        return count;
    }
    public int go(int a, int b) {
        int count = 0;
        for(int k = a; k < b; k++) {
            count += permuteK(k, b);
        }
        return count;
    }

    public void process() throws Exception {
//        preprocess();
 //       System.out.println("Hi");
       //Read input
       int t = Integer.parseInt(ins.readLine());

       for(int T=1; T<=t;T++) {
            String x = ins.readLine().trim().replaceAll(" +", " ");
            String[] tokens = x.split(" ");
            int a = Integer.parseInt(tokens[0]);
            int b = Integer.parseInt(tokens[1]);
            
            outs.println("Case #" + T + ": " + go(a,b));
        }
    }

    public static void main(String args[]) throws Exception {
        //Input
        InputStreamReader fis = new FileReader(INPUT);
        BufferedReader bis = new BufferedReader(fis);

        //Output
        PrintStream ps = OUTPUT!=null ? new PrintStream(OUTPUT) : System.out;
        
        C c = new C(bis, ps);

        c.process();
        return;
    }
}
