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.BufferedWriter;
import java.io.File;
import java.io.FileWriter;
import java.io.PrintWriter;
import java.util.HashSet;
import java.util.Scanner;
public class C {
	public static void main(String[] args) throws Exception{
		Scanner sc = new Scanner(new File("C.in"));
		PrintWriter out = new PrintWriter(new BufferedWriter(new FileWriter("C.out")));
		int N = Integer.parseInt(sc.nextLine());
		for(int i=1;i<=N;i++){
			HashSet<String> HS = new HashSet<String>();
			int A = sc.nextInt();
			int B = sc.nextInt();
			for(int a=A;a<=B;a++){
				String x = a+"";
				for(int b=1;b<x.length();b++){
					String temp = x.substring(b)+x.substring(0,b);
					if(temp.charAt(0)=='0')continue;
					int other = Integer.parseInt(temp);
					if(other>=A&&other<=B&&other!=a){
						HS.add(x+" "+temp);
					}
				}
			}
			out.println("Case #"+i+": "+(HS.size()>>1));
		}
		out.close();
	}
}
