/*
 * 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 template {

    private StringBuilder result = new StringBuilder();
    
    public static void main(String[] args) {
        new template().go();
    }

    public void go() {

        File inputFile = new File("/Users/amornchaikanokpullwad/Documents/input.in");
        BufferedReader br = null;

        try {
            br = new BufferedReader(new FileReader(inputFile));
            int numTests = Integer.parseInt(br.readLine());
            
            for (int testCounter = 0; testCounter < numTests; ++testCounter) {
                int count = 0;
                String text[] = br.readLine().split(" ");
                long A = Long.parseLong(text[0]);
                long B = Long.parseLong(text[1]);
                for (long i = A; i <= B; i++) {
                    for (int j = 1; j < Long.toString(i).length(); j++) {
                        //System.out.println(j + " " + i);
                        long temp = reverse(Long.toString(i),j);
                        if (temp <= i) continue;
                        if (temp <= B) {
                            System.out.println(i+"+"+B);
                            count++;
                        }
                    }
                    
                    
                    //System.out.println(i+"+"+B);
                    
                    
                    
                }
                appendResult(testCounter, count);
            }
        } catch (FileNotFoundException fe) {
            fe.printStackTrace();
        } catch (IOException ie) {
            ie.printStackTrace();
        } finally {
            try {
                if (br != null) {
                    br.close();
                }
            } catch (IOException ex) {
                ex.printStackTrace();
            }
        }
        writeResultToFile();
        System.out.println(result);
    }

    private void appendResult(int testCase, int outp) {

        result.append("Case #" + (testCase+1) + ": ");
        result.append(outp+"");

        result.append("\n");
    }

    private void writeResultToFile() {
        PrintWriter pr = null;

        try {
            pr = new PrintWriter(new File("/Users/amornchaikanokpullwad/Documents/output.in"));
            pr.print(result);

        } catch (FileNotFoundException e) {
            e.printStackTrace();
        } finally {
            if (pr != null) {
                pr.close();
            }
        }
    }
    
    private long reverse(String in,int le){
       
        StringBuilder temp = new StringBuilder();
        for (int i = le; i > 0; i--) {
            //System.out.println(in);
            temp.append(in.charAt(in.length()-i));
            
        }
        for (int i = 0; i < in.length()-le; i++) {
            temp.append(in.charAt(i));
        }
        return Long.parseLong(temp.toString());
    }
}