/*
 * 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.FileWriter;
import java.io.IOException;
import java.io.PrintWriter;
import java.util.ArrayList;
import java.util.StringTokenizer;


public class RecycledNumbers {

	public static void main(String[] args) throws IOException{
		BufferedReader br = new BufferedReader(new FileReader("recycle.in"));
		PrintWriter out = new PrintWriter(new FileWriter("recycle.out"));
		int n = Integer.parseInt(br.readLine());
		StringTokenizer st;
		for(int count = 1; count <= n; count++){
			st = new StringTokenizer(br.readLine());
			int A = Integer.parseInt(st.nextToken());
			int B = Integer.parseInt(st.nextToken());
			boolean[] hasBeen = new boolean[B+1];
			int numPairs = 0;
			for(int i = A; i <= B; i++){
				if(hasBeen[i] == true) continue;
				hasBeen[i] = true;
				ArrayList<Integer> cycle = rotate(i);
				int numCycles = 1;
				for(int num: cycle){
					if(num > B || num < A) continue;
					if(hasBeen[num]) continue;
					hasBeen[num] = true;
					numCycles++;
				}
				numPairs += (numCycles*(numCycles-1))/2;
			}
			out.println("Case #" + count + ": " + numPairs);
		}
		out.close();
	}
	
	static ArrayList<Integer> rotate(int num){
		ArrayList<Integer> ans = new ArrayList<Integer>();
		int length = String.valueOf(num).length();
		for(int i = 1; i < length; i++){
			if(num%10 == 0){
				num = (int)((num%10)*Math.pow(10, length-1)) + num/10;
			} else {
				num = (int)((num%10)*Math.pow(10, length-1)) + num/10;
				ans.add(num);
			}
		}
		return ans;
	}
}
