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

 public static void main(String[] args) {
      try {
         BufferedReader in = new BufferedReader(new InputStreamReader(System.in));
         String s = in.readLine().trim();
         int t = Integer.parseInt(s);
 
         for (int i = 0; i < t; i++) {
            String[] input = in.readLine().trim().split(" ");
            int a = Integer.parseInt(input[0]);
            int b = Integer.parseInt(input[1]);
            int total = 0;

           int n;
           int m;
           while (a <= b) {
              n = a;
              m = n+1; 
              while (m <= b) {
               //System.out.println("PAIR (n,m) = (" + n + "," + m + ")");
                StringBuffer strN = new StringBuffer(""+n);  
                //System.out.println("strN: " + strN);  
                for (int j = 0; j < strN.length()-1; j++) {
                  strN.append(strN.charAt(0));
                  strN.delete(0,1);
                  //System.out.println("shifted strN..." + strN ); 
                  //System.out.println("BUG" + strN.toString().equals(""+m));
                  if (Integer.parseInt(strN.toString()) == m) {
                     //System.out.println("^--------PAIR FOUND-------^");
                     total++;
                     break;
                  }
/*
                  if (a < Integer.parseInt(n.toString()) && Integer.parseInt(n.toString()) <= b) {
System.out.println("---------->found pair (n,m) = (" + a + "," + n + ")" );
                     total++;
                  } 
               else if (Integer.parseInt(n.toString()) == a && Integer.parseInt(n.toString()) == b ) {
                  total++; 
               }  
                  else if (Integer.parseInt(n.toString()) == b) {
System.out.println("---------->found pair (n,m) = (" + a + "," + n + ")" );
                     total++; 
                  }
                  else { System.out.println("*********>IS NOT a pair (n,m) = (" + a + "," + n + ")" ); } */
       /*           if (Integer.parseInt(n.toString()) == a) { total++; break; } */
                }  
                m++;
              }
              a++;
           }


/*
            while (a <= b) {
               if ( a < 10 ) {
                  break;
               }  
               StringBuffer n = new StringBuffer(""+a);  
System.out.println("n: " + n);  
               for (int j = 0; j < n.length()-1; j++) {
                  n.append(n.charAt(0));
                  n.delete(0,1);
                  System.out.println("shifted n..." + n ); /*
                  if (a < Integer.parseInt(n.toString()) && Integer.parseInt(n.toString()) <= b) {
System.out.println("---------->found pair (n,m) = (" + a + "," + n + ")" );
                     total++;
                  } 
               else if (Integer.parseInt(n.toString()) == a && Integer.parseInt(n.toString()) == b ) {
                  total++; 
               }  
                  else if (Integer.parseInt(n.toString()) == b) {
System.out.println("---------->found pair (n,m) = (" + a + "," + n + ")" );
                     total++; 
                  }
                  else { System.out.println("*********>IS NOT a pair (n,m) = (" + a + "," + n + ")" ); } */
       /*           if (Integer.parseInt(n.toString()) == a) { total++; break; }
               }*/
/*  
                  if (Integer.parseInt(n.toString()) < a || Integer.parseInt(n.toString()) > b) {
                   
                  } 
                  else if (n.charAt(0) == '0' || input[1].charAt(0) == '0' ) {

                  }
                  else if (Integer.parseInt(n.toString()) == a && Integer.parseInt(n.toString()) == b ) {
                     total++;                
                  } 
                  else if (Integer.parseInt(n.toString()) > a && Integer.parseInt(n.toString()) <= b ) {
                     total++;
                  }   
               } */  /*
              a++;
            }  
            System.out.println("Case #" + (i+1) + ": " + total);  */
            System.out.println("Case #" + (i+1) + ": " + total);  
         }   
         
      }
      catch (IOException e) {
         e.printStackTrace();
      }   	
 }
}
