/*
 * 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.BufferedWriter;
import java.io.File;
import java.io.FileWriter;
import java.io.IOException;
import java.util.Scanner;


public class A {
	
	static int findRecycledNumbers(int a, int b) {
		int count = 0;
		boolean[] arr = new boolean[b+1];
		
		for (int i = a; i <= b; i++) {
			String num = Integer.toString(i);
			for (int k = 0; k < arr.length; k++) arr[k] = false;
			for (int j = 1; j < num.length(); j++) {
				String dNum = num.substring(j) + num.substring(0, j);
				int x = Integer.parseInt(dNum);
				if (x >= a && x <= b && !arr[x]) arr[x] = true;
				else continue;
				if (x >= a && x <= b && i < x) {
					System.out.println(a + " - " + b + ": " + i + " " + x);
					count++;
				}
			}
		}
		
		return count;
	}
	
	public static void main(String args[]) throws IOException {		
		Scanner sc = new Scanner(new File("input"));
		FileWriter fstream = new FileWriter("output");
		BufferedWriter out = new BufferedWriter(fstream);
	
		
		int n = sc.nextInt();
		for (int i = 0; i < n; i++) {
			int a = sc.nextInt();
			int b = sc.nextInt();
			out.write("Case #" + (i+1) + ": " + findRecycledNumbers(a, b) + "\n");
		}
		
		out.close();
	}
}
