import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.HashSet;

public class Recycled {
    public static void main(String[] args) {
        try {
            BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
            int t = Integer.parseInt(br.readLine());
            for (int i = 0; i < t; i++) {
                String[] str = br.readLine().split(" ");
                int a = Integer.parseInt(str[0]);
                int b = Integer.parseInt(str[1]);
                System.out.println("Case #" + (i + 1) + ": " + find(a, b));
            }
        } catch (IOException e) {
            e.printStackTrace();
        }
    }

    private static int find(int a, int b) {
        HashSet<Long> used = new HashSet<Long>();
        int digits = String.valueOf(a).length();
        if (digits == 1) return 0;
        for (int i = a; i <= b; i++) {
            int s = 10;
            int m = (int) Math.pow(10, digits-1);
            for (int j = 0; j < digits-1; j++) {
                int r = i % s;
                if (r < s/10) continue;
                int q = i / s;
                int rn = r * m + q;
                s *= 10; m /= 10;
                if (i != rn && rn >= a && rn <= b) {
                    long pp;
                    if (rn < i) pp = (long)rn << 30 | i;
                    else pp = (long)i << 30 | rn;
                    if (!used.contains(pp)) {
                        used.add(pp);
                    }
                }
            }
        }
        return used.size();
    }
}

package source;

import java.io.BufferedWriter;
import java.io.File;
import java.io.FileWriter;
import java.io.IOException;
import java.util.Scanner;
import java.util.Set;
import java.util.TreeSet;

public class RecycledNumbers {

	/**
	 * @param args
	 */
	public static void main(String[] args) throws IOException{
		Scanner scan = new Scanner(new File(""));
		BufferedWriter bw = new BufferedWriter(new FileWriter(""));
		
		int testCases = new Integer(scan.nextLine());
		Set<String> pairs = null;
		
		for(int i=0; i < testCases; i++){
			String[] nums = scan.nextLine().split(" ");
			int min = new Integer(nums[0]);
			int max = new Integer(nums[1]);
			pairs = new TreeSet<String>();
			
			int testNum = min;
			while(testNum <= max){
				getRecycled(testNum, pairs, min, max);
				++testNum;
			}
			bw.write("Case #"+(i+1)+": "+pairs.size()+"\n");
		}
		bw.flush();
		bw.close();
	}
	
	public static void getRecycled(int testNum, Set<String> pairs, int min, int max){
		int rec = 0;
		String number = Integer.toString(testNum);
		
		StringBuilder sb = new StringBuilder("");
		for(int i=1; i < number.length(); i++){
			sb.append(number.substring(i)).append(number.substring(0, i));
			try{
				rec = new Integer(sb.toString());
				if(testNum != rec && min <= rec && rec <= max && 
						!pairs.contains(testNum+"-"+rec) && !pairs.contains(rec+"-"+testNum)){
					pairs.add(testNum+"-"+rec);
				}
			} catch(NumberFormatException e){}
			sb.delete(0, sb.length());
		}
	}

}
