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.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.LinkedList;
public class C {

	public static void main(String[] args) throws NumberFormatException, IOException {
		BufferedReader input = new BufferedReader(new InputStreamReader(System.in));

		int n = Integer.parseInt(input.readLine());

		for(int j=0;j<n;j++){
			char[] numbers;
			char[] newNumbers;
			int newNumber=-1;
			int count = 0;

			String AB[] = input.readLine().split(" ");
			int A = Integer.parseInt(AB[0]);
			int B = Integer.parseInt(AB[1]);


			for(Integer original= B; original>A;original--){
				numbers = original.toString().toCharArray();
				perm:
					do{
						newNumbers = new char[numbers.length];
						newNumbers[0]=numbers[numbers.length-1];

						for(int i=1; i<numbers.length ;i++){
							newNumbers[i]=numbers[i-1];
						}
						numbers = newNumbers.clone();
//						if(numbers[0]=='0'){
//							continue perm;
//						}
						newNumber = charToInt(newNumbers);
						if (newNumber>B || newNumber<A){
							continue perm;
						}
						if(newNumber<=B && newNumber>=A && newNumber<original){
							count++;
							//System.out.print(newNumber+"\n");
						}
					}while(newNumber!=original);
			}
			System.out.print("Case #" +(j+1) + ": " + count +"\n");
		}
	}
	public static int charToInt(char[] number){
		int value=0;
		for(int i=0;i<number.length;i++){
			value+= (number[number.length-1-i]-48)*Math.pow(10, i);
		}
		return value;
	}

}
