/*
 * 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.*;
public class Palindrome
 {
     public static void main(String args[]) throws IOException
     {
         int N;
         int a,b,i;
         String s[];
         BufferedReader br=new BufferedReader(new InputStreamReader(System.in));
         N=Integer.parseInt(br.readLine());
         for(i=1;i<=N;i++)
         {
             s=br.readLine().split(" ");
             a=Integer.parseInt(s[0]);
             b=Integer.parseInt(s[1]);
             System.out.println("Case #"+i+": "+calc(a,b));
            }
        }
        
     public static int calc(int a,int b)
     {
         int i,j,k,p1,p2,cnt=0;
         int tmp[];
         p1=-1;
         p2=-1;
         for(i=a;i<b;i++)
         {            
            tmp=permute(i);
            for(k=0;k<tmp.length;k++)
            {
                j=tmp[k];
                //
                if(i<j&&j<=b)
                {
                    if(p1==i&&p2==j)
                    {
                    }
                    else
                    {
                        p1=i;p2=j;
                     //System.out.println(i+" "+j);
                     cnt++;
                    }
                }
            }
        }
         return cnt;
       }
       
       public static int[] permute(int tmp)
       {
           int digits=0;
           int cnt,k,i;
           int vals[];
           k=tmp;
           
           String s="";          
           while(k!=0)
           {
               s=(k%10)+s;
               k=k/10;
               digits++;
            }
            cnt=0;
            vals=new int[digits];
           for(i=digits-1;i>=0;i--)
           {
               vals[cnt++]=Integer.parseInt(s.substring(i,digits)+s.substring(0,i));
            }
            return vals;
        }
    }
        
      