/*
 * 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.BufferedWriter;
import java.io.FileReader;
import java.io.FileWriter;

public class RecycledNumbers {
	private static boolean isRecycled(long f,long s){

		String str1 = String.valueOf(f);
		String str2 = String.valueOf(s);
		
		if(str1.length()!=str2.length()){
			return false;
		}
		
		for(int i=1;i<str1.length();i++){
			String tmp = str1.substring(i)+str1.substring(0, i);
			if(tmp.equals(str2)){
				return true;
			}
		}
		
		return false;
	}
	
	public static void main(String[] args) {
			try{
				// Get the object of DataInputStream
				//DataInputStream in = new DataInputStream(System.in);
				BufferedReader br = new BufferedReader(new FileReader("C-small-attempt0.in"));
				FileWriter fstream = new FileWriter("out.txt");
				BufferedWriter out = new BufferedWriter(fstream);
				String strLine;
				
				strLine = br.readLine();
				int T = Integer.valueOf(strLine);
				for(int i=0;i<T;i++){
					long counter = 0;
					strLine = br.readLine();
					String[] list = strLine.split(" ");
					long A = Long.valueOf(list[0]);
					long B = Long.valueOf(list[1]);
					for(long j=A;j<=B;j++){
						for(long k=j+1;k<=B;k++){
							if(isRecycled(j,k)){
								counter++;
							}
						}
					}
										
					out.write("Case #"+(i+1)+": "+counter+"\n");
				}

				//Close the input stream
				br.close();
				out.close();
			}catch (Exception e){//Catch exception if any
				System.err.println("Error: " + e.getMessage());
				e.printStackTrace();
			}		

		}
}
