/*
 * 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.File;
import java.io.PrintWriter;
import java.util.Arrays;
import java.util.Scanner;


public class C {
	public static void main(String[] args) throws Exception{
		long tIni=System.currentTimeMillis();
		Scanner s=new Scanner(new File("./data/C.txt"));
		PrintWriter pw=new PrintWriter(new File("./data/C_sol.txt"));
		int ncases=s.nextInt();s.nextLine();
		for(int curr=0;curr<ncases;curr++){
			int ans=0;
			
			int A=s.nextInt(),B=s.nextInt();
			int len=(""+A).length();
			
			for(int j=A;j<B;j++){
					int [] used=new int[len]; int lastUsed=0; Arrays.fill(used, -1);
					int base=10;
					int exp=10;
					for(int i=1;i<len-1;i++)
						exp*=10;
					for(int k=1;k<len;k++){
						
						int r=j%base;
						int div=j/base;
						
						int resp=r*exp+div;
						
						
						if(resp>A && resp<=B && resp>j )
						{
							boolean ok=true;
							for(int i=0;i<len;i++)
								if(resp==used[i])
									ok=false;
							if(ok){
								ans++;
								//System.out.println(j+" "+resp);
								used[lastUsed++]=resp;
							}
						}
						
						base*=10;
						exp/=10;
				}
			}
			
			/**for(int i=A;i<B;i++){
				int [] used=new int[len]; int lastUsed=0; Arrays.fill(used, -1);
				
				String numS=i+"";
				for(int k=1;k<len;k++){
					String o = numS.substring(k)+numS.substring(0,k);
					if(Integer.parseInt(o)>i && Integer.parseInt(o)<=B ){
						boolean ok=true;
						int resp=Integer.parseInt(o);
						for(int j=0;j<len;j++)
							if(resp==used[j])
								ok=false;
						if(ok){
							ans++;
							//System.out.println(j+" "+resp);
							used[lastUsed++]=resp;
						}
					}
				}
			}*/
			
			pw.println("Case #"+(curr+1)+": " +ans);
			System.out.println("+++++++++++++++");
		}
		long tFin=System.currentTimeMillis();
		System.out.println("Time: "+ (tFin-tIni) +" msec");
		pw.close();
		
	}
	
}
