/*
 * 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 C {

	public static void main(String[] args) throws Exception {
		BufferedReader in = new BufferedReader(new FileReader(args[0]));
		in.readLine();
		
		int caseNum = 0;
		while (in.ready()) {
			solve(++caseNum, in.readLine());
		}
	}
	
	public static void solve(int caseNum, String caseInput) {		
		String[] inputSegments = caseInput.split(" ");
		String i1 = inputSegments[0];
		String i2 = inputSegments[1];
		int v1 = Integer.parseInt(i1);
		int v2 = Integer.parseInt(i2);
		int d = i1.length();
		int baseValue = (int) Math.pow(10, d);
		
		HashSet<String> uniquePair = new HashSet<String>();
		if (baseValue == 1) {
			// do nothing
		} else {
			String n;
			int value;
			for (int i = v1; i <= v2; ++i) {
				n = String.valueOf(i);
				for (int j = 1; j < d; ++j) {
					value = Integer.parseInt(n.substring(j) + n.substring(0, j));
					if (value >= v1 && value <= v2 & value != i) {
						uniquePair.add(n + " - " + value);
					}
				}
			}
		}
		System.out.printf("Case #%d: %d\n", caseNum, uniquePair.size()/2);
	}
}