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.ArrayList;
import java.util.List;

public class RecyclePair {
	
	private static boolean IsRecycle(int a, int n, int m, int b, List<String> pairs, String pair){
		return a <= n && n < m && m <= b && !pairs.contains(pair);
	}
	
	public static int Calculate(int a, int b){
		int count = 0;

		List<String> pairs = new ArrayList<String>();

		for(int n=a;n<=b;n++){
			for(int j=1;j<String.valueOf(n).length(); j++){
				String m = String.valueOf(n).substring(j) + String.valueOf(n).substring(0, j);
				String pair = n + "," + m;

				if(IsRecycle(a, n, Integer.parseInt(m), b, pairs, pair)){
					pairs.add(pair);    
					count++;
				}
			
			}
		}

		return count;
	}
}
