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.*;
public class Main {
	public static void main(String[] args) {
		try{
			FileReader in = new FileReader("input.txt");
			BufferedReader inFile = new BufferedReader(in);
			FileWriter outFile = new FileWriter("output.txt");
			int test = Integer.parseInt(inFile.readLine());
			for(int i=1;i<=test;i++){
				String line = inFile.readLine();
				String values[]=line.split(" ");
				int A = Integer.parseInt(values[0]);
				int B = Integer.parseInt(values[1]);
				int count = 0;
				for(int j=A;j<B;j++){
					for(int k=j+1;k<=B;k++){
						String temp = (new Integer(j)).toString();
						temp=(temp+temp);
						if(temp.contains((new Integer(k)).toString())) count++;
					}
				}
				outFile.write("Case #" + i + ": " + count + "\n");
			}
			inFile.close();
			outFile.close();
			
		}catch(Exception exp){
			exp.printStackTrace();
		}
	}
}
