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;
	}

}

/**
 * Google CodeJam 2012
 * Qualification round - Problem C
 * Recycled Numbers
 * 
 * Solved by Üllar Soon <positivew@gmail.com>
 */
package eu.positivew.codejam.recycled;

import java.io.BufferedReader;
import java.io.IOException;

import eu.positivew.codejam.framework.CodeJamInputCase;
import eu.positivew.codejam.framework.CodeJamInputParser;


/**
 * Recycled Numbers input parser class.
 * 
 * @author Üllar Soon <positivew@gmail.com>
 */
public class RecycledNumbersParser implements CodeJamInputParser {

	@Override
	public CodeJamInputCase readCase(BufferedReader input) {
		CodeJamInputCase inCase;
		
		try {
			String line = input.readLine();
			String[] args = line.split(" ");
			Integer[] abArr = new Integer[args.length];
			for(int i = 0; i < args.length; i++) {
				try {
					abArr[i] = Integer.parseInt(args[i]);
				}
				catch(NumberFormatException ex) {
					System.err.println("Badly formatted test case data!");
				}
			}
			inCase = new RecycledNumbersCase(abArr);
			return inCase;
		}
		catch (IOException e) {
			System.err.println("Failed to read test case data!");
			return null;
		}
	}

}
