import java.io.FileInputStream;
import java.util.HashMap;
import java.util.Scanner;
import java.util.TreeSet;

// Recycled Numbers
// https://code.google.com/codejam/contest/1460488/dashboard#s=p2

public class C {

	private static String process(Scanner in) {
		int A = in.nextInt();
		int B = in.nextInt();
		int res = 0;
		int len = Integer.toString(A).length();
		for(int n = A; n < B; n++) {
			String str = Integer.toString(n);
			TreeSet<Integer> set = new TreeSet<Integer>();
			for(int i = 1; i < len; i++) {
				int m = Integer.parseInt(str.substring(i, len) + str.substring(0, i));
				if ( m > n && m <= B && ! set.contains(m) ) {
					set.add(m);
					res++;
				}
			}
		}
		return Integer.toString(res);
	}

	public static void main(String[] args) throws Exception {
		Scanner in = new Scanner(System.in.available() > 0 ? System.in : 
			new FileInputStream(Thread.currentThread().getStackTrace()[1].getClassName() + ".practice.in"));
		int T = in.nextInt();
		for(int i = 1; i <= T; i++) 
			System.out.format("Case #%d: %s\n", i, process(in));
	}
}

import java.io.*;
import java.util.Scanner;
import java.util.Arrays;

public class RecycleNums {

    public static void main(String[] args) throws FileNotFoundException {
		File input = new File(args[0]);
        Scanner scan = new Scanner(input);
		PrintStream output = new PrintStream(new File("C-small.out"));
		
		int cases = scan.nextInt();
		
		for (int i = 0; i < cases; i++) {
			int first = scan.nextInt();
			int second = scan.nextInt();
			int result = checkRange(first, second);
			output.print("Case #" + (i + 1) + ": " + result);
			if (i != cases - 1) output.println();
		} // for
		
    } // main

	public static int checkRange(int min, int max) {
		int count = 0;
		
		for (int i = min; i < max; i++) {
			for (int j = i + 1; j <= max; j++) {
				if (isRecycleNums(i, j)) count++;
			} // for
		} // for
		
		return count;
		
	} // checkRange
	
	public static boolean isRecycleNums(int a, int b) {
		char[] first = Integer.toString(a).toCharArray();
		char[] second = Integer.toString(b).toCharArray();
		
		if (first.equals(second)) return true;
		
		for (int i = 0; i < first.length; i++) {
			rotateArray(first);
			if (Arrays.equals(first, second)) return true;
		} // for
		
		return false;
		
	} // isRecycleNums
	
	public static void rotateArray(char[] myChars) {
		char first = myChars[0];
		for (int i = 0; i < myChars.length - 1; i++) {
			myChars[i] = myChars[i+1];
		} // for
		myChars[myChars.length - 1] = first;
	} // rotateArray

} // RecycleNums