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

}

package assignments;

import java.util.ArrayList;
import java.util.List;
import java.util.Scanner;

import base.Assignment;

public class AssignmentC implements Assignment {

	private int min;
	private int max;

	@Override
	public String solve() {
		int total = 0;
		int length = (int) Math.log10(min) + 1;
		for (int i = min; i < max; i++) {
			List<Integer> counted = new ArrayList<Integer>();
			for (int j = 1; j < length; j++) {
				int shifted = shift(i, j, length);
				if (shifted > i && shifted <=max && !counted.contains(shifted)) {
					counted.add(shifted);
					total++;
				}
			}
		}
		return Integer.toString(total);
	}

	private int shift(int i, int shift, int length) {
		int temp = (int) Math.pow(10, shift);
		
		int result = (i % temp) * ((int)Math.pow(10, length - shift)) + ((int)i / temp);
		return result;
	}

	public static Assignment createFromScanner(Scanner scanner) {
		AssignmentC assignment = new AssignmentC();
		assignment.min = scanner.nextInt();
		assignment.max = scanner.nextInt();
		return assignment;
	}

}
