/*
 * 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.io.File;
import java.io.FileNotFoundException;
import java.util.ArrayList;
import java.util.Arrays;
import java.util.HashMap;
import java.util.List;
import java.util.Map;
import java.util.Scanner;


public class TaskC {

	static int numberLength;
	
	public static void main(String[] args ) throws FileNotFoundException {
		File fileName = new File("taskc.txt");
		Scanner inFile = new Scanner(fileName);
		int n = inFile.nextInt();
		inFile.useDelimiter("\\r?\\n");
		String[] cases = new String[n];
		for (int i = 0; i < n; i++)
			cases[i] = inFile.next();
		List<String> result = new ArrayList<String>();
		for (String caseString: cases) {
			int recycledNumbers = 0;
			Scanner caseScanner = new Scanner(caseString);
			String lowerBoundString = caseScanner.next();
			int lowerBound = Integer.parseInt(lowerBoundString);
			int upperBound = caseScanner.nextInt();
			for (int i = lowerBound; i <= upperBound; i++) {
				String iString = new Integer(i).toString();
				for (int j = i + 1; j <= upperBound; j++) {
					String jString = new Integer(j).toString();
					if (evaluate(iString, jString))
						recycledNumbers++;
				}
			}
			result.add("" + recycledNumbers);
		}
		
		for (int i = 0; i < result.size(); i++) {
			System.out.println("Case #" + (i+1) + ": " + result.get(i));
		}
	}

	private static boolean evaluate(String iString, String jString) {
		for (int n = 1; n < jString.length(); n++) {
			String testString = jString.substring(n) + jString.substring(0, n);
			if (iString.equals(testString))
				return true;
		}
		return false;
	}
	
}
