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


public class Recycle {

	public static void main(String[] args) throws IOException {
		BufferedReader f = new BufferedReader(new FileReader("C-small-attempt0.in"));
		PrintWriter out = new PrintWriter(new BufferedWriter(new FileWriter("Recycle.out")));
		StringTokenizer st;
		
		st = new StringTokenizer(f.readLine());
		int T = Integer.parseInt(st.nextToken());
		
		int A, B;
		int numDigit;
		int temp, temp1, temp2, tempPow;
		int countRecycle;
		int[] result = new int[T];
		boolean[] set = new boolean[3000];
		for(int i = 0; i < T; i++) {
			for(int j = 0; j < 1000; j++)
				set[j] = false;
			
			st = new StringTokenizer(f.readLine());
			A = Integer.parseInt(st.nextToken());
			B = Integer.parseInt(st.nextToken());
			
			for(int j = A; j <= B; j++) {
				countRecycle = 1;
				if(set[j])
					continue;
				else {
					set[j] = true;
					numDigit = 1;
					while(j/(int)Math.pow(10, numDigit) != 0)
						numDigit++;
					for(int k = 1; k < numDigit; k++) {
						tempPow = (int) Math.pow(10, k);
						temp1 = j/tempPow;
						temp2 = j - temp1 * tempPow;
//						System.out.println("j: " + j + "\ntemp1: " + temp1 + "\ntemp2: " + temp2 + "\ntempPow: " + tempPow);

						if(temp2*10 / tempPow == 0)
							continue;
						temp = temp2 * (int) Math.pow(10, numDigit - k) + temp1;
						
//						System.out.println("j: " + j + "\ntemp1: " + temp1 + "\ntemp2: " + temp2 + "\ntemp:" + temp);
						
						if( (A <= temp) && ( temp <= B) && (!set[temp]) ) {
							set[temp] = true;
							countRecycle++;
						}				
					}
				}
				result[i] += countRecycle * (countRecycle - 1) / 2;
			}
		}
		
		for(int i = 0; i < T; i++) {
			out.println("Case #" + (i + 1) + ": " + result[i]);
		}
		
		out.close();
	}

}
