/*
 * 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.awt.List;
import java.io.BufferedReader;
import java.io.BufferedWriter;
import java.io.FileNotFoundException;
import java.io.FileReader;
import java.io.FileWriter;
import java.io.IOException;
import java.util.ArrayList;
import java.util.HashMap;
import java.util.HashSet;
import java.util.StringTokenizer;

public class recycle {
	static int lower = 0;
	static int upper = 0;
	static int count = 0;
	static HashSet<String> num_list = new HashSet<String>();
	public static void PerformShift(int number) {
		int start = number;
		int numdigits = (int) Math.log10((double) number);
		int multiplier = (int) Math.pow(10.0, (double) numdigits);
		while (true) {
			//int q = number / 10;
			int r = number % 10;			
			number = number / 10;
			number = number + multiplier * r;			
					
			boolean flg = true;
			int bits = 0;			
			
			if(number != start && number >= lower && number <=upper) {
				num_list.add(number+":"+start);
				num_list.add(start+":"+number);	
			}
			
			if (number == start)
				break;
		}
	}

	public static void main(String[] args) throws IOException {
		BufferedReader in = new BufferedReader(new FileReader("input.txt"));
		BufferedWriter out = new BufferedWriter(new FileWriter("output.txt"));
		int no_cases = Integer.parseInt(in.readLine());
		for (int index = 0; index < no_cases; ++index) {
			StringTokenizer limits = new StringTokenizer(in.readLine()," ");
			lower = Integer.parseInt(limits.nextToken());
			upper = Integer.parseInt(limits.nextToken());
			int start = (int) System.currentTimeMillis();
			for (int i = lower; i <= upper; ++i) {
				if(i<9)
					continue;
				PerformShift(i);
			}
			if(index==no_cases-1)
				out.write("Case #" + (index + 1) + ": " + num_list.size()/2);
			else out.write("Case #" + (index + 1) + ": " + num_list.size()/2 + "\n");
			num_list.clear();
		}
		out.close();
	}
}
