import java.io.FileInputStream;
import java.util.HashMap;
import java.util.Scanner;
import java.util.TreeSet;

// Recycled Numbers
// https://code.google.com/codejam/contest/1460488/dashboard#s=p2

public class C {

	private static String process(Scanner in) {
		int A = in.nextInt();
		int B = in.nextInt();
		int res = 0;
		int len = Integer.toString(A).length();
		for(int n = A; n < B; n++) {
			String str = Integer.toString(n);
			TreeSet<Integer> set = new TreeSet<Integer>();
			for(int i = 1; i < len; i++) {
				int m = Integer.parseInt(str.substring(i, len) + str.substring(0, i));
				if ( m > n && m <= B && ! set.contains(m) ) {
					set.add(m);
					res++;
				}
			}
		}
		return Integer.toString(res);
	}

	public static void main(String[] args) throws Exception {
		Scanner in = new Scanner(System.in.available() > 0 ? System.in : 
			new FileInputStream(Thread.currentThread().getStackTrace()[1].getClassName() + ".practice.in"));
		int T = in.nextInt();
		for(int i = 1; i <= T; i++) 
			System.out.format("Case #%d: %s\n", i, process(in));
	}
}


import java.io.*;

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

/**
 *
 * @author RockHead
 */
public class Recycle {
    
     public static void main(String args[]) throws FileNotFoundException, IOException
    {
        BufferedReader reader = new BufferedReader(new FileReader("C:\\Users\\RockHead\\Desktop\\C-small-attempt0.in"));
        BufferedWriter writer = new BufferedWriter(new FileWriter("C:\\Users\\RockHead\\Desktop\\Recycle_Sol.txt"));
        int testNo = Integer.parseInt(reader.readLine());
        int count=0;
        for(int i=1;i<=testNo;i++)
        {
            String str=reader.readLine();                
            String[] info=str.split(" ");
            
            int A=Integer.parseInt(info[0]);
            int B=Integer.parseInt(info[1]);
            
            int n=A;
           for(int j=n;j<B;j++)
           {
              int m=j+1;
               for(int k=m;k<=B;k++)
               {
                  // System.out.println("Recycle (" + j +" "+ k  +") "+ isRecycled(Integer.toString(j),Integer.toString(k)));
                   if(isRecycled(Integer.toString(j),Integer.toString(k)))
                    count++;
               }
           } 
            System.out.println("Case #"+ i+": "+count );
            writer.write("Case #"+ i+": "+count);
            writer.newLine();
            count=0;
            
        }
        
        
        reader.close();
        writer.close();
}
     
     
     public static boolean isRecycled(String a,String b)
     {
        //move from the back of a to the front 
         for(int i=a.length();i>0;i--)
         {
             String subOne=a.substring(i);
             String subTwo=a.substring(0,i);
             String newString=subOne+subTwo;
             if(newString.equals(b))
                return true;
         }
         
         return false;
     }
     }
