/*
 * 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.
 */




import java.io.*;
import java.util.HashMap;
import java.util.Iterator;
import java.util.Map;
/**
 *
 * @author Sagar
 */
public class Recycled_Numbers
{

    Map m;
    int no_of_test_cases = 0;
    StringBuffer [] sb;
    Integer []output ;
    String inputfile = "";
    String outputfile = "";
    Integer [][] input ;
    int no_of_digits = 0;

    public Recycled_Numbers()
    {
        m = new HashMap();

    }


    public void setInputOutput(String input, String output)
    {
        inputfile = input;
        outputfile = output;
    }

    public void readFile()
    {
        String line="";
        boolean firstTime = true;
        int i = 0;
         try
        {
            FileReader filename = new FileReader(inputfile);
            BufferedReader reader = new BufferedReader(filename);
            while((line=reader.readLine()) !=null)
            {
                if(firstTime)
                {
                    firstTime = false;
                    no_of_test_cases = Integer.parseInt(line);
                    System.out.println("testcases:"+no_of_test_cases);
                    output = new Integer[no_of_test_cases];
                    for (int s = 0;s<no_of_test_cases;s++)
                        output[s]= new Integer(0);
                    input = new Integer[no_of_test_cases][2];
                    //for(int j=0;j<no_of_test_cases;j++)
                     //   output[j] = new Integer;
                }
                else
                {
                   String [] tokens = line.split(" ");

                   input[i][0]=Integer.parseInt(tokens[0]);
                   input[i++][1]=Integer.parseInt(tokens[1]);
                }
            }

         /*   for(int k=0;k<no_of_test_cases;k++)
            {
                System.out.println(input[k][0] + " " + input[k][1] );
            } */
        }
        catch(IOException e)
        {
            System.out.println("Input File not found");
        }
    }

    public void processFile()
    {
        HashMap <String, Integer> map = new HashMap();
        for (int i=0;i<no_of_test_cases;i++)
        {

            for(Integer j=input[i][0];j<input[i][1];j++)
            {
                StringBuffer num = new StringBuffer(j.toString());
               // System.out.println("Num 1: "+ num.toString());
                no_of_digits = num.length();
                for(int k=0; k<no_of_digits-1;k++)
                {
                    StringBuffer outputbuf = new StringBuffer();
                    outputbuf.append(num.substring(no_of_digits-1));
                    outputbuf.append(num.substring(0, no_of_digits-1));

                 //   System.out.println("outputbuf : "+ outputbuf.toString());
                    
                    Integer m = Integer.parseInt(outputbuf.toString());
                   // System.out.println("M : "+ m+  " J: "+ j);
                    if(m>j && (m<=input[i][1]))
                    {
                        if(!map.containsKey(outputbuf.toString()))
                            map.put(outputbuf.toString(),new Integer(1));
                    }
                    num = new StringBuffer(outputbuf.toString());
                   // System.out.println("Num 2: "+ num.toString());

                }
                //System.out.println("Map size " + map.size());
                output[i] = output[i] + new Integer (map.size());
                map.clear();
            
            }
           // System.out.println("OutPut"+i+ +output[i]);
        }
    }

    public void displayOutput()
    {
        try
        {
            // Create file
            FileWriter fstream = new FileWriter(outputfile);
            BufferedWriter out = new BufferedWriter(fstream);
            for(int i=0;i<no_of_test_cases;i++)
            {
                out.write("Case #"+(i+1)+": ");
                out.write(output[i].toString());
                out.newLine();

            }
            //Close the output stream
            out.close();
        }
        catch (Exception e)
        {//Catch exception if any
            System.err.println("Error: " + e.toString());
        }

        
    }
    public static void main(String []args)
    {
        Recycled_Numbers obj = new Recycled_Numbers();
        obj.setInputOutput("C:\\Users\\Sagar\\Desktop\\myWork\\C-small-attempt0.in", "C:\\Users\\Sagar\\Desktop\\myWork\\output2.txt");
        obj.readFile();
        obj.processFile();
        obj.displayOutput();
    }

}
