package qual;

import java.util.Scanner;

public class RecycledNumbers {

	public static void main(String[] args) {
		new RecycledNumbers().run();

	}

	private void run() {
		Scanner sc = new Scanner(System.in);
		int T = sc.nextInt();
		for (int t = 0; t < T; t++) {
			int A = sc.nextInt();
			int B = sc.nextInt();
			int result = solve(A, B);
			System.out.printf("Case #%d: %d\n", t + 1, result);
		}
	}

	public int solve(int A, int B) {
		int result = 0;
		for (int i = A; i <= B; i++) {
			int dig = (int) Math.log10(A/*same as B*/) + 1;
			int aa = i;
			for (int d = 0; d < dig - 1; d++) {
				aa = (aa % 10) * (int)Math.pow(10, dig - 1) + (aa / 10);
				if (i == aa) {
					break;
				}
				if (i < aa && aa <= B) {
//					System.out.printf("(%d, %d) ", i, aa);
					result++;
				}
			}
		}
		return result;
	}

}

import java.io.*;
import java.util.HashSet;

public class Solution {
	public static void main(String[] args) throws IOException {
		StreamTokenizer in = new StreamTokenizer(new BufferedReader (new FileReader("input.in")));
		PrintWriter out = new PrintWriter(new File("output.out"));
		
		in.nextToken();
		int t = (int)in.nval;
		for (int i = 0; i<t; i++){
			out.print("Case #" + (i+1) + ": ");
			int ans = 0;
			in.nextToken();
			int a = (int)in.nval;
			in.nextToken();
			int b = (int)in.nval;
			for (int j = a; j<=b; j++){
				int n = j;
				HashSet<Integer> set = new HashSet<Integer>();
				StringBuilder sN = new StringBuilder((new Integer(j)).toString());
				for (int k = 0; k<sN.length()-1; k++){
					sN.insert(0, sN.charAt(sN.length()-1));
					sN.deleteCharAt(sN.length()-1);
					if (sN.charAt(0) != '0') {
						int m = Integer.valueOf(sN.toString());
						if (n<m && m>=a && m<=b && !set.contains(new Integer(m))) {
							ans++;
							set.add(m);
						}
					}
				}
			}
			out.println(ans);
		}
		out.close();
	}
}
