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

public class RecycledNumbers {
    public static void clear(int[] arr){
    	for(int i=0; i<30; i++)
    		arr[i] = -1;		
    }
    public static boolean checkEntry(int x, int[] arr){
    	for(int i=0; i<30; i++) {
    		if(x == arr[i])
    			return true;
    	}
    	return false;	
    }
    
    
    public static void main(String[] args) throws IOException {
    
    String[] spl;
    int counter = 1;
    int count = 0;
		BufferedReader in = new BufferedReader(new InputStreamReader(System.in));
		String input;
		int a,b,e = 0;
		String xform;
		int[] arr = new int[30]; int arrCounter = 0;
		clear(arr); 
		
		while((input = in.readLine()) != null){
			spl = input.split(" ");
			a = Integer.parseInt(spl[0]);
			b = Integer.parseInt(spl[1]);
			int bLength = (Integer.toString(b)).length();
			for(int i=a; i<b; i++) {
				clear(arr); arrCounter = 0;
				xform = Integer.toString(i);
				int l = xform.length();
				//System.out.println("number:" + xform + '\t' + "length:" + l);
				for(int j=1; j<l; j++) {	
					for(int k=0; k<l; k++){
						int index = (k + j) % l;
						if(xform.charAt(index) < xform.charAt(k))
							break;
						else if(xform.charAt(index) > xform.charAt(k)) {
							if( (bLength > l) || (b >= (e = Integer.parseInt(xform.substring(j) + xform.substring(0 , j)))) ) {    
								//System.out.println("number:" + xform + '\t' + Integer.parseInt(xform.substring(j) + xform.substring(0 , j)));
								if(!checkEntry(e , arr)){
									count++;
									arr[arrCounter] = e;
									arrCounter++;
								}
								break;
							}
							else
								break;
						}
						else
							continue;
					}
				}
			}
			
			System.out.println("Case #" + counter + ": " + count );
			counter++; count = 0;
		}
		
		    

}}
