/*
 * 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.BufferedOutputStream;
import java.io.File;
import java.io.FileNotFoundException;
import java.io.FileOutputStream;
import java.io.PrintStream;
import java.util.ArrayList;
import java.util.Iterator;
import java.util.List;
import java.util.Scanner;

public class C {

	static final char[] digit = { '0', '1', '2', '3', '4', '5', '6', '7', '8', '9' };
	
	/**
	 * @param args
	 */
	public static void main(String[] args) {
		
		Scanner sc = null;
		if (args != null && args.length > 0) {
			
			try {
				sc = new Scanner(new File(args[0]));
					
				if (args.length > 1) {
					System.setOut(new PrintStream(new BufferedOutputStream(new FileOutputStream(new File(args[1])), 128)));
				}
			} catch (FileNotFoundException e) {
				
				// e.printStackTrace();
				sc = new Scanner(System.in);
			}
			
		} else {
			
			sc = new Scanner(System.in);
		}

		int T = Integer.valueOf(sc.nextLine());
		
		for (int i = 0; i < T; i++) {
			
			int A = sc.nextInt();
			int B = sc.nextInt();
			
			int answer = solve(A, B);
			System.out.printf("Case #%d: %d\n", i + 1, answer);
			
		}
		System.out.close();
	}
	
	public static int solve(int A, int B) {
		
		int answer = 0;
		int seedNum = A;
		do {
			
			answer += hasRecycled(seedNum++, A, B);
			
		} while (seedNum < B);
		return answer;
	}
	
	public static int hasRecycled(long seedNum, long A, long B) {
		
		int count = 0;
		int ptr;
		char[] old_num_chars = String.valueOf(seedNum).toCharArray();
		int length = old_num_chars.length;
		char[] moved_num_chars = new char[length];
		List<Long> newNumList = new ArrayList<Long>();
		
		for (int i = length - 1; i > 0; i--) {
			
			ptr = i;
			for (int j = 0; j < length; j++) {
				
				if (ptr == 0) {
					
					moved_num_chars[ptr] = old_num_chars[length - 1];							
				} else {			
					
					moved_num_chars[ptr] = old_num_chars[ptr - 1];					
				}
				
				if (--ptr < 0) {
					ptr += length;
				}
				
			}
			
			
			long newNum = Long.valueOf(new String(moved_num_chars));
			if ( seedNum < newNum && newNum <= B) {
				
				boolean isNew = true;
				for (Iterator<Long> it = newNumList.iterator(); it.hasNext();) {
					Long l = it.next();
					
					if (l.equals(newNum)) {
						isNew = false;
						break;
					}
				}
				if (isNew) {
					newNumList.add(newNum);					
					count++;
					
				}
			}
			old_num_chars = moved_num_chars.clone();
			
		}
		
		return count;
	}

}
