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.File;
import java.io.FileNotFoundException;
import java.util.Scanner;


public class RecycledNumber {
	public static void main (String[] args) throws FileNotFoundException{

		Scanner scan = new Scanner (new File ("input.txt"));
		int caseNumber = scan.nextInt();
		scan.nextLine();
		
		for(int k=0; k<caseNumber; k++){
			int result = 0;
			int A = scan.nextInt();
			int B = scan.nextInt();
			
			for (int i = A ; i <= B ; i++){
				for (int j = 1; j < numberOfDigits(i) ; j++){
					if (digit(i,j)>=digit(i,numberOfDigits(i))){
						if (A <= recycle(i,j) && B >= recycle(i,j) && i<recycle(i,j)){
							result++;
						}
					}

				}
			}
			System.out.println("Case #"+(k+1)+": "+result);
			if (scan.hasNextLine()){
				scan.nextLine();
			}
		}

	}
	
	static int numberOfDigits(int number){
		return ((int)Math.floor(Math.log10(number))) + 1;
	}
	
	static int recycle(int number, int digit){
		int newPrefix =  (((int)(number%Math.pow(10, digit)))*(int)Math.pow(10, (numberOfDigits(number)-digit)));
		int newSuffix = number/(int)(Math.pow(10, digit)) ;
		return newPrefix+newSuffix;
	}
	
	static int digit(int number, int digit){
		return (number/(int)(Math.pow(10,digit-1)))%10;
	}
}
