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.util.*;
class Main {	
	static Scanner in = new Scanner(System.in);
	static Set<String> set = new HashSet<String>();
	
	public static void serie(int n, int m){
		for(int i=n;i<=m;i++){
			String a = i+"";
			int len = a.length()-1;
			for(int k=len;k>=1;k--){
				String res = a.substring(k, len+1) + a.substring(0, k);
				int val = Integer.parseInt(res);
				if((val+"").length() == (i+"").length() && val<=m && i<val){
					set.add(i+","+val);
				}
			}
		}
	}
	public static void resolve(){
		int n,m;
		set = new HashSet<String>();
		n = in.nextInt(); m = in.nextInt();
		serie(n,m);	
		
	}
	public static void main(String arg[]){
		int n;
		n = in.nextInt();
		for(int i=0;i<n;i++){
			resolve();
			System.out.println("Case #"+(i+1)+": " + set.size());
		}
	}
}

/*
4
1 9
10 40
100 500
1111 2222
*/
