import java.util.*;
import java.io.*;

public class recycled_numbers {
	public static void main(String[]a) throws Exception{
		
		Scanner f = new Scanner(new File(a[0]));
		int result=0;
		int A,B;
		String n,m;
		HashSet<String> s=new HashSet<String>();
		
		int T=f.nextInt();	//T total case count
		for (int t=1; t<=T;t++){//for each case t
			
			s.clear();
			result=0;				//reset
			A=f.nextInt();B=f.nextInt();	//get values for next case
			
			if (A==B)result=0;//remove case not meeting problem limits 
			else{
				for(int i=A;i<=B;i++){//for each int in range
					n=Integer.toString(i);
					m=new String(n);
					//System.out.println(n);
					for (int j=1;j<n.length();j++){//move each digit to the front & test
						m = m.substring(m.length()-1)+m.substring(0,m.length()-1);
						if(m.matches("^0+[\\d]+")!=true &&
								Integer.parseInt(m)<=B &&
								Integer.parseInt(n)<Integer.parseInt(m)){
							s.add(new String(n+","+m));
							//result++;
							//System.out.println(" matched: "+m);
						}
						
					}
				}
				result = s.size();
			}

			//display output
			System.out.println("Case #" + t + ": " + result);
		}
	}
}

import java.io.File;
import java.io.FileNotFoundException;
import java.io.IOException;
import java.util.Scanner;

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

/**
 *
 * @author Akash Agrawal
 */
public class RN {
    
    public static boolean check(int n , int []arr)
    {
        for(int i=0;i<arr.length;i++)
        {
            if(n==arr[i])return false;
        }
        return true;
    }
    
    public static void main(String [] args) throws FileNotFoundException, IOException
    {
        Scanner scan= new Scanner(new File("Input.in"));
        int n=scan.nextInt();
        int cas=1;
        while(n--!=0)
        {
            String s1 = scan.next() , s2 = scan.next();
            int A=Integer.parseInt(s1);
            int B=Integer.parseInt(s2);
            //System.out.println(A+B);
            int count = 0;
            
            for(int i=A;i<B;i++)
            {//System.out.println(i);
                String temp = Integer.toString(i);
                int ar[] = new int[s1.length()-1];
                int ind=0;
                for(int a=0;a<ar.length;a++)
                {
                    ar[a]=-1;
                }
                for(int j=1;j<s1.length();j++)
                {
                    
                    String temps = temp.substring(j) + temp.substring(0,j);
                    int C=Integer.parseInt(temps);
                    //System.out.println(s1.substring(0,j));
                    if(C>i && C<=B && check(C,ar))
                       {
                           count++;
                           //System.out.println(i+" "+C);
                           ar[ind++]=C;
                       }
                    
                }
                
                
            }
            System.out.println("Case #"+cas+++": "+count);
            
        }
        
    }
    
}
