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

	static int digits(int A){
		if (A<10) return 1;
		return 1+digits(A/10);
	}
	static int[] decimal(int n, int d){
		int[] t = new int[d];
		
		for (int i = d-1; i>=0; i--){
			t[i]=n-10*(n/10);
			n=n/10;
		}
		
		return t;
	}
	static boolean equals(int[] t1, int[] t2, int d){
		for (int i=0; i<d; i++){
			if (t1[i]!=t2[i]) return false;
		}
		return true;
	}
	
	static boolean permute(int[] t1, int[] t2, int d){
		
		for (int j = 0; j<d; j++){
			int aux=t1[0];
			for (int i=0; i<d-1; i++) t1[i]=t1[i+1];
			t1[d-1]=aux;
			
			if (equals(t1, t2, d)) return true;
		}
		
		return false;
	}
	
	public static void main(String[] args){
		Scanner in = new Scanner(System.in);
		int T =in.nextInt();
		for (int k = 1; k<=T; k++){
			int A = in.nextInt();
			int B = in.nextInt();
			int comp = 0;
			int d = digits(A);
			
			for(int m = A; m<=B; m++){
				for (int n =A; n<m; n++){
					int t1[] = decimal(n,d);
					int t2[] = decimal(m,d);
					if (permute(t1, t2, d)) comp++;
				}
			}
			
			
		
		
		
		System.out.println("Case #"+k+": "+comp);
		}
	}
}
