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 eu.positivew.codejam.framework.CodeJamInputCase;


/**
 * Recycled Numbers test case class.
 * 
 * @author Üllar Soon <positivew@gmail.com>
 */
public class RecycledNumbersCase implements CodeJamInputCase {
	
	private Integer[] value = null;
	
	public RecycledNumbersCase(Integer[] value) {
		this.value = value;
	}

	public Integer[] getValue() {
		return value;
	}

	public void setValue(Integer[] value) {
		this.value = value;
	}
	
	public int getA() {
		if(value.length >= 2)
			return value[0];
		else
			return -1;
	}
	
	public int getB() {
		if(value.length >= 2)
			return value[1];
		else
			return -1;
	}

	@Override
	public String getType() {
		return "Integer[]";
	}

}
