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

import java.io.File;
import java.io.FileWriter;
import java.util.ArrayList;
import java.util.Scanner;

/**
 *
 * @author daniele
 */
public class GCJ_C {
    
    public static void main(String[] args) throws Exception{
        
        
        
        Scanner in = new Scanner(new File(args[0]));
        FileWriter out = new FileWriter("/home/daniele/Scrivania/Output");
        

        int prove=in.nextInt();
        int min,max;
        int cifre;
        int cifreaus;
        String temp;
        int aus;
        int count=0;
        ArrayList<Integer> vals = new ArrayList<Integer>();
        int jcount=0;
        ArrayList<Integer> perm = new ArrayList<Integer>();
        
        out.write("");
        out.flush();
        
        for(int i=1;i<=prove;i++){
            
            out.append("Case #" +i+": ");out.flush();
            
            min=in.nextInt();
            max=in.nextInt();
            
            for(int j=min;j<=max;j++){
               if(!vals.contains(j)){
                    temp=""+j;
                    cifre=temp.length();
                    aus=j;
                    perm.add(j);
                    for(int k=1;k<cifre;k++){
                        aus=rotateOnce(aus);
                        temp=""+aus;
                        cifreaus=temp.length();//elusione zeri iniziali
                        if(aus>=min && aus<=max && aus!=j && cifreaus==cifre && nobody(vals,perm)){ 
                            perm.add(aus);
                            jcount ++;
                            
                        }
                        
                    }
                    while(jcount>0){count+=jcount; jcount--;}
                    vals.addAll(perm);
                    perm= new ArrayList<Integer>();
                    
                }
            }
            out.append(count+"\n");out.flush();
            count=0;
            vals= new ArrayList<Integer>();
        }
        
        
        
    }
        static public int rotateOnce(int n){
            String s=""+n;
            if(s.length()>1){
                s=s.charAt(s.length()-1) + s.substring(0,s.length()-1);
                n=Integer.parseInt(s);
            }
            return n;
        }    
        
        static public boolean nobody(ArrayList<Integer> v,ArrayList<Integer> a){;
            for(int i=0;i<a.size();i++)
                if(v.contains(a.get(i))) return false;
            return true;
        } 
    
}


import java.io.BufferedReader;
import java.io.FileReader;
import java.io.IOException;
import java.util.ArrayList;
import java.util.List;


public class testC {

    public static void main(String args[]){
     
        
        
       int count=0;
       int A=1111;
       int B=2222;
       String str="";
       String a="";
       String b="";
       int n=0;
       int m=0;
       boolean flag=false;
       
       char s[] = ((B)+"").toCharArray();
       char t[];
       int digits = 0;
       List<Integer> list = new ArrayList<Integer>();
       try{
           FileReader fr = new FileReader("2.txt");
           BufferedReader br = new BufferedReader(fr);
           int size = Integer.parseInt(br.readLine());
           for(int loop=0;loop<size;loop++){
        	   count=0;
        	   flag=false;
        	   a="";
        	   b="";
        		 str= br.readLine();
        		 char arraychar[] = str.toCharArray();
        		 for(int mm=0;mm<str.length();mm++){
        			 if(arraychar[mm] == ' '){
        				 flag=true;
        				 continue;
        			 }
        			 if(!flag)
        				 a+=arraychar[mm];
        			 if(flag)
        				 b+=arraychar[mm];
        		 }
        		 A = Integer.parseInt(a);
        		 B = Integer.parseInt(b);
       for(int i=A;i<=B;i++)
       {
           s = ((i)+"").toCharArray();
           digits = s.length;
         
               t = new char[digits];
               for(int k = 0; k <digits; k++)
               {
                   
            	   t = findRecyclingNumber(s,k);
                   
            	   n =  Integer.parseInt(String.valueOf(t));
            	   if(n<=B && n>=A && n>i && !list.contains(n) && i>=A)
                   {
                        count++;
                       // System.out.println(i+" "+n);
                        list.add(n);
                   }
               }
               list.clear();
       }
       System.out.println("Case #"+(loop+1)+": "+count);
       //System.out.println("Case #"+(loop+1)+": "+count+"    For "+A+" "+B);
           }
       br.close();
       fr.close();
   
   }catch(IOException ex){
       ex.printStackTrace();
   }
      
}

	private static char[] findRecyclingNumber(char[] s,int digits) {
		// TODO Auto-generated method stub
		char t[] = new char[s.length];
		
		for(int i=0;i<=digits;i++){
			t[i] = s[s.length-digits-1+i];
		}
		int index=0;
		for(int i=digits+1;i<s.length;i++){
			t[i] = s[index++];
		}
		
		return t;
	}

}
