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.*;
import java.util.Scanner;
 
public class functions {
	int solve(String A, String B){

		int result = 0;

		int n = A.length();
		int a = Integer.parseInt(A);
		int b = Integer.parseInt(B);
		int i = 0, j = 0, k = 0, index = 0;
		String temp_a = A;
		String temp2 = "";
		int[] array = new int[8];
		for(i = 0; i<8;i++) array[i] = -1;
		
		i = 0;
		int jj = 0,kk = 0;
		while(Integer.parseInt(A) < b-1){
			
			for( index = 0; index <= n-2; index++){
				temp2 = "";
				kk = 0;
				for(j = index; j >= 0; j--){
					temp2 = temp2 + A.charAt(n-1-j);
				}
				for(k = 0; k < n-index-1; k++){
					temp2 = temp2 + A.charAt(k);
				}
				
				int c = Integer.parseInt(temp2);
				if ( c <= b && c > Integer.parseInt(A)) {
					for(jj = 0; jj < 8; jj++){
						if(array[jj] == c){
							break;
						}
					}
					if(jj == 8){
					result = result + 1;
					array[kk++] = c;
					}
					System.out.println("("+A+","+temp2+")");
				}

			}
			A = Integer.toString(Integer.parseInt(A)+1);
			i++;
		}
		
		return result;
	}
}
