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.Scanner;


public class ProblemC {
	public static void main(String args[]){
		Scanner scanner = new Scanner(System.in);
		int noTestCases = Integer.parseInt(scanner.nextLine());
		
		for(int i=0;i<noTestCases;i++){
			String inputString = scanner.nextLine();
			String[] temp;
			temp = inputString.split(" ");
			int A = Integer.parseInt(temp[0]);
			int B = Integer.parseInt(temp[1]);
			
			int count = 0;
			for(int n=A;n<B;n++){
				for(int m=n+1;m<=B;m++){
					//System.out.println("n="+n +"m="+m);
					String N = Integer.toString(n);
					String M = Integer.toString(m);
					StringBuffer NN = new StringBuffer(N);
					NN = NN.append(N);
					N = NN.toString();
					if(N.contains(M)){
						count++;
					}
					
				}
			}
			System.out.println("Case #"+(i+1)+": "+count);
			
		}
	}
}
