/*
 * 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.BufferedReader;
import java.io.BufferedWriter;
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.Iterator;
import java.util.Map;

/**
 * 
 * @author ysan
 *
 */

public class Problem_C_small {
	

	public static void main(String[] args) throws NumberFormatException,
			IOException {

		BufferedReader in = new BufferedReader(new FileReader("C-small-attempt0.in"));
		BufferedWriter out = new BufferedWriter(new FileWriter("C-small-output0.txt"));
		
		int cases = Integer.parseInt(in.readLine());
		
		 for (int i = 1; i <= cases; i++) {
			 String text = in.readLine().trim();
			 String[] val = text.split(" ");
			 int count = 0;
			 int lasta=0,lastb=0;
			 
			 int a = Integer.parseInt(val[0]);
			 int b = Integer.parseInt(val[1]);
			 
			 for(int j=a; j<b; j++){ 
				 
//				 if(i < 4)break;
				 String g = Integer.toString(j);
				 
				 for(int k=g.length()-1; k>0; k--){
					 int r = switchIt(g, k);
					 if(r > j && r <= b && r != j){
						 
						 if(lasta == j && lastb == r) continue;
						 lasta = j;
						 lastb = r;
						 count++;

					 }
				 }
				 
			 }
			 out.write("Case #"+ i +": " + count);
			 out.newLine();
			 
			 
		 }
		 
		
		in.close();
		out.close();
		
		
		

	}
	
	
	static int switchIt(String v, int p){
		int r=0;
		
		String a = v.substring(p);
		String b = v.substring(0, p);
		
		if(a.charAt(0) != '0'){
			r = Integer.parseInt((a+b));
		}
		return r;
		
	}
}
