/*
 * 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.ArrayList;
import java.util.List;

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

/**
 *
 * @author home
 */
public class RecycledNumbers {
      public static void main(String args[])throws IOException{
        FileReader reader = new FileReader("D:\\NetBeansProjects\\DBInteractionWithWS\\src\\java\\C-small-attempt0.in");
		BufferedReader br = new BufferedReader(reader);
		File file = new File("rloutput.txt");
		FileWriter fw = new FileWriter(file);
		int count = Integer.parseInt(br.readLine());
		for(int s=0;s<count;s++){
                   int recycledNumbers=0;
                   String str = br.readLine();
                   //System.out.println(str);
                   int start = Integer.parseInt(str.split(" ")[0]);
                   int end  = Integer.parseInt(str.split(" ")[1]);
                     for(int i=start;i<end;i++){
                         List<String> list = new ArrayList();
                         if(end<=10)
                             break;
                         else{
                         
                             if(i<=10)
                                 continue;
                             String temp1 = i+"";
                             for(int j=1;j<temp1.length();j++){
                                 
                                 String subString=temp1.substring(temp1.length()-j)+temp1.substring(0,temp1.length()-j);
                                 
                                if(!subString.startsWith("0"))
                                 if(!temp1.equals(subString)){
                                     
                                     if((i<Integer.parseInt(subString))&&(Integer.parseInt(subString)<=end)){
                       
                                          if(list.isEmpty()){
                                                                 //System.out.println(temp1+" : "+subString);
                                              list.add(subString);
                                              recycledNumbers++;
                                          }
                                          else if(!available(subString,list)) {
                                                                 //System.out.println(temp1+" : "+subString);
                                              list.add(subString);
                                              
                                            recycledNumbers++;
                                          }
                                     }
                                 }
                             }
                     
                        }
                     }
                     System.out.println("Case #"+(s+1)+": "+recycledNumbers);
                     
                     
                }
      }
      public static boolean available(String str, List list){
          
          for(int i=0;i<list.size();i++){
              
                 //System.out.println((String)list.get(i));
              
              if(((String)list.get(i)).equals(str)){
                  
                  return true;
              }
          }
          
          return false;
      }
}
