/*
 * To change this template, choose Tools | Templates
 * and open the template in the editor.
 */

package recycled;

import java.io.BufferedReader;
import java.io.DataInputStream;
import java.io.FileInputStream;
import java.io.FileWriter;
import java.io.InputStreamReader;
import java.io.PrintWriter;
import java.util.TreeSet;

/**
 *
 * @author Alfred
 */
public class Main {

    /**
     * @param args the command line arguments
     */
    public static void main(String[] args) {
    try {
            FileInputStream fstream = new FileInputStream("C-small-attempt0.in");
            DataInputStream in = new DataInputStream(fstream);
            BufferedReader br = new BufferedReader(new InputStreamReader(in));
            FileWriter outFile = new FileWriter("out.txt");
            PrintWriter out = new PrintWriter(outFile);
            String line;
            line = br.readLine();
            int cases = Integer.parseInt(line);
            for (int i=1; i<=cases;i++){
                line = br.readLine();
                String[] values = line.split(" ");
                int A = Integer.parseInt(values[0]);
                int B = Integer.parseInt(values[1]);
                int total=0;
                for (int n=A; n<=B;n++){
                    TreeSet<String> solutions = new TreeSet<String>();
                    for (int k=1;k<values[1].length();k++){
                        String m = circshift(n,k);
                        int mVal = Integer.parseInt(m);
                        if(mVal<=B && mVal!=n  && mVal> n && !m.startsWith("0") && m.length()==Integer.toString(n).length() )
                        {
                            solutions.add(m);
                        }                   
                    }
                    total+=solutions.size();
                }
                out.println("Case #"+i+": "+total);
            }
            in.close();
            out.close();
        } catch (Exception e) {//Catch exception if any
            System.err.println("Error: " + e.getMessage());
        }

}

    private static String circshift(int n, int k) {
        String nString=Integer.toString(n);
        int len=nString.length();
        String m =  nString.substring(len-k)+nString.subSequence(0, len-k);
        //System.out.println(n+" "+m);
        return m;
    }

}

import java.util.*;

public class RCTest{

	public static void main(String[] args){
	
		Scanner scan = new Scanner(System.in);
		int numberOfCases = Integer.parseInt(scan.nextLine());
		for(int i = 1; i <= numberOfCases; ++i){
			String line = scan.nextLine();
			String[] inputs = line.split(" ");
			int lower = Integer.parseInt(inputs[0]);
			int upper = Integer.parseInt(inputs[1]);
			RCTest r = new RCTest();
			System.out.println("Case #" + i + ": " + r.getRecycleNumbers(lower, upper));
		}
	}
	
	public int getRecycleNumbers(int a, int b){
		this.lower = a;
		this.upper = b;
		int counter = 0;
		for(int i = a; i<=b; ++i){
			int originalNumber = i;
			int index = getIndex(originalNumber);
			int recycledNumber = getRecycledNumber(i,index);
			
			while(originalNumber!=recycledNumber){
			
				if(originalNumber < recycledNumber && recycledNumber <= upper)++counter;
				recycledNumber = getRecycledNumber(recycledNumber,index);
			}
			
		}
		return counter;
	}
	public int getRecycledNumber(int number, int index){
		int remainder = number % 10;
		int quotient = number/10;
		int recycledNumber = ((int)Math.pow(10,index) * remainder) +  quotient;
		return recycledNumber;
	}	
	
	private int getIndex(int number){
		int index = 0;
		while(number!=0){
			number/=10;
			++index;
		}
		return index-1;
	}
	private int lower;
	private int upper;
}