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.HashSet;
import java.util.Scanner;


public class Main {
	public static void main(String[] args) {
		Scanner r = new Scanner(System.in);
		
		int T = r.nextInt();
		int caseNumber = 1;
		while(T-- > 0){
			int A = r.nextInt();
			int B = r.nextInt();
			
			int ret = 0;
			for(int x = A; x <= B; x++){
				HashSet<Integer> S = new HashSet<Integer>();
				
				int curr = x;
				int L = (curr + "").length();
				int L10 = 1;
				for(int i = 0; i < L - 1; i++)
					L10 *= 10;
				
				for(int itr = 0; itr < L; itr++){
					if((curr + "").length() == L && !S.contains(curr) && curr <= B && curr >= A && curr < x){
						ret++;
					}
					
					S.add(curr);
					curr = R(curr, L10);
				}
			}
			
			System.out.printf("Case #%d: %d\n", caseNumber++, ret);
		}
	}
	static int R(int x, int L){
		int m = x % 10; 
		return (x / 10) + (L * m);
	}
}
