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.PrintStream;
import java.util.HashMap;
import java.util.Map;
import java.util.Scanner;


public class main {

	/**
	 * @param args
	 */
	public static void main(String[] args) {
		try {
			System.setOut(new PrintStream(new File("C-small-attempt0.out")));
			
			Scanner sc = new Scanner(new File("C-small-attempt0.in"));
			
			int T = sc.nextInt();
			sc.nextLine();
			
			for (int t = 1; t<=T; t++) {
				int y = 0;
				int A = sc.nextInt();
				int B = sc.nextInt();
				
				for (int n = A; n<B; n++) {
					String s = Integer.toString(n);
					
					for (int j = 1; j < s.length(); j++) {
						String s2 = s.substring(j, s.length()) + s.substring(0, j);
						int m = Integer.parseInt(s2);
						if(n<m && m<=B) {
							y++;							
						}
					}
				}
				
				System.out.format("Case #%d: %d%n", t, y);
			}
			
		} catch (FileNotFoundException e) {
			e.printStackTrace();
		}		
	}

}
