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

    class recycled_numbers
   {
       public static void main(String[] args) throws Exception
      {
         BufferedReader in = new BufferedReader(new FileReader("recnum.in"));
         PrintWriter out = new PrintWriter(new BufferedWriter(new FileWriter("recnum.out")));
      
         int n = Integer.parseInt(in.readLine());
         int ans = 0;
         for(int x = 0; x<n; x++)
         {
            out.print("Case #" + (x+1) + ": ");
            ans = 0;
            String input = in.readLine();
            StringTokenizer token = new StringTokenizer(input, " ");
            int a = Integer.parseInt(token.nextToken());
            int b = Integer.parseInt(token.nextToken());
            for(int y = a; y<=b; y++)
            {
               for(int z = y+1; z<=b; z++)
               {
                  if(recycled("" +y,""+z))
                     ans++;
               }
            }
            out.println(ans);
         }
         out.close();
      }
       public static boolean recycled(String a, String b)
      {
         if(a.length() != b.length() || hash(a)!=hash(b))
				return false;
         //if(a.length() < b.length())
         //   return recycled("0"+a, b);
			//else if(b.length() < a.length())
			//	return recycled(a,"0"+b);
     
	   	
         for(int x = 0; x<a.length(); x++)
         {
            if(a.equals(b))
               return true;
            a = a.substring(1,a.length())+a.substring(0,1);
         }
         if(a.equals(b))
            return true;
         return false;
      }
		
		public static int hash(String a)
		{
			int sum = 0;
			for(int x = 0; x<a.length(); x++)
			{
				int b = (int)(a.charAt(x));
				sum+=b;
			}
			return sum;
		}
   }