/*
 * 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 codejam;

import java.io.FileNotFoundException;
import java.io.FileReader;
import java.util.ArrayList;
import java.util.*;
import java.util.Scanner;

/**
 *
 * @author Mash
 */
public class Main {
  
  public static void main(String args[]) throws FileNotFoundException {

      Scanner in = new Scanner(new FileReader("C:\\ima\\ans.txt"));
                int T=in.nextInt();
                int A,B;

                String a,b,perm;
                char[] per;

                String filler="0000000";

                for(int i=1;i<=T;i++){
                    int res=0;

                    A=in.nextInt();
                    B=in.nextInt();

                    b=Integer.toString(B);

                    for(int j=A;j<=B;j++){
                        int ans;
                   // Set list= new HashSet<Character[]>();
                     Set<String> list=new HashSet<String>();
                    a=Integer.toString(j);
                    int des=b.length()-a.length();
                    perm=filler.substring(0, des)+j;
                    //System.out.println(perm);
                    //per=perm.toCharArray();
                    //permute(per, 0, b.length());
                    String add;
                    for(int s=0;s<=perm.length();s++){
                        add=perm.substring(s)+perm.substring(0,s);
                        list.add(add);
                    }
                    ans=0;
                    Iterator it=list.iterator();
                    //System.out.println("j is"+j);
                    while(it.hasNext())
                    {
                     String comp=(String) it.next();
                     //System.out.println(comp);
                     int com=Integer.parseInt(comp);
                     if(com>j&&com<=B)ans++;
                      }
                    //System.out.println("answer is"+ans);
                    res+=ans;
                    }
                    System.out.println("Case #"+i+": "+res);
                }
    
  }

}
