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.*;
import java.io.*;

public class C{
	
	public static void main(String[] args) throws IOException{
		Scanner inp = new Scanner(new File("C-small-attempt0.in"));
		PrintWriter pw = new PrintWriter(new FileWriter("c-small.out"));
		
		int numCases = inp.nextInt();
		
		for (int cas = 0; cas < numCases; cas++){
			pw.print("Case #" + (cas+1) + ": ");
			
			/* case input */
			int A = inp.nextInt();
			int B = inp.nextInt();
			/* end case input */
			
			int ABak = A;
			int numDigits = 0;
			while (ABak > 0){
				ABak /= 10;
				numDigits++;
			}
			
			int ans = 0;
			
			/* main logic */
			for (int i = A; i < B; i++){
				
				Set<Integer> validMs = new HashSet<Integer>();
				for (int j = 1; j < numDigits; j++){
					int b = shift(i, j, numDigits);
					
					if (b <= B && b > i){
						validMs.add(new Integer(b));
					}
				}
				ans += validMs.size(); 
			}
			pw.println(ans);
		}
		pw.close();
	}
	
	public static int shift(int x, int k, int l){
		//int d = (int) Math.pow(10, k);
		int d = 1;
		for (int p = 1; p <= k; p++){
			d *= 10;
		}
		int tmp = x % d;
		int d2 = 1;
		for (int p = 1; p <= (l - k); p++){
			d2 *= 10;
		}
		tmp *= d2;
		return ((x/d) + tmp);
	}
}
