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.File;
import java.io.FileNotFoundException;
import java.io.FileOutputStream;
import java.io.PrintStream;
import java.util.Scanner;

public class ProblemC {
	public static void main(String[] args) throws FileNotFoundException {
		PrintStream out = new PrintStream(new FileOutputStream(new File(
				"c-small.out")));
		Scanner in = new Scanner(new File("C-small-attempt0.in"));

		int T = in.nextInt();

		for (int i = 1; i <= T; i++) {
			int A = in.nextInt();
			int B = in.nextInt();
			
			int count = 0;
			
			for(int n = A; n <= B; n++){
				String origstr = Integer.valueOf(n).toString();
				String str = shift(origstr);;
				while(!str.equals(origstr)){
					int shifted = Integer.parseInt(str);
					
					//System.out.printf("n: %d, shift: %s, shifted: %d, valid: %b\n", n, str, shifted, shifted > n);
					
					if(shifted > n && shifted <= B)
						count++;
					
					str = shift(str);
				}
			}
			
			out.printf("Case #%d: %d\n", i, count);
		}

		in.close();
		out.close();
	}
	
	public static String shift(String num){
		return num.charAt(num.length()-1) + num.substring(0,num.length()-1);
	}
}
