/*
 * 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.File;
import java.io.FileNotFoundException;
import java.io.FileReader;
import java.io.FileWriter;
import java.io.IOException;
import java.util.HashMap;
import java.util.HashSet;
import java.util.Iterator;


public class R1Q3 {
	public static HashMap<String, String> wordMap;
	
	public static void main(String []args) throws NumberFormatException, IOException{
		BufferedReader bf = new BufferedReader(new FileReader(new File("input")));
		BufferedWriter bw = new BufferedWriter(new FileWriter(new File("output")));
		int num = Integer.parseInt(bf.readLine());
		String aString = "123";
		
		for (int i = 1 ; i<=num; i++){
			int nums = 0;
			String line = bf.readLine();
			String[] argss =line.split(" ");
			int small = Integer.parseInt(argss[0]);
			int large = Integer.parseInt(argss[1]);
			HashSet<Integer> already = new HashSet<Integer>();
			for (int j = small; j< large; j++){
				if (j<10) continue;
				already.clear();
				already.add(j);
				String temp = String.valueOf(j);
				for (int k = 1; k < temp.length(); k++){
					int m = k;
					int newnum  = j/(int)(Math.pow(10, temp.length()-k));
					newnum+= (j%(int)(Math.pow(10, temp.length()-k)))*Math.pow(10, k);
					if (!already.contains(newnum)&&newnum<=large&&newnum>=small&&newnum>j){
						nums++;
						already.add(newnum);
					}
				}
				if (j == 1221) System.out.println(already.toString());
				
			}
			bw.write("Case #"+i+": "+nums+"\n");
		}
		bf.close();
		bw.close();
	}
}
