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

import java.io.File;
import java.io.FileNotFoundException;
import java.util.Scanner;

public class QualB {
	Scanner scanner = null;
	int caseLog = 0;
	int A = 0;
	int B = 0;
	/**
	 * @param args
	 */
	public static void main(String[] args) {
		QualB b = new QualB();
		b.go();
	}
	
	public void go() {		
		try {
			scanner = new Scanner(new File("input.txt"));
		} catch (FileNotFoundException e) {
			e.printStackTrace();
		}
		int N = scanner.nextInt();	
		for (int i=1; i <= N; i++) {
			scanner.nextLine();
			System.out.print("Case #" + i +": ");
			System.out.println(doCase());
		}
	}
	
	public int doCase() {
		int rval = 0;
		A = scanner.nextInt();
		B = scanner.nextInt();
		caseLog = (int) Math.log10(A);
		
		if (A < 10)
			return 0;
		
		for (int i = A; i <= B; i++) {
			rval += recycle(i);
		}
		return rval;
	}
	
	public int recycle(int i) {
		int rval = 0;
		for (int log = caseLog; log > 0; log--) {
			int recycled = 0;
			int dec = (int) Math.pow(10, log);
			int rdec = (int) Math.pow(10, caseLog - (log - 1));
			recycled += (i % dec) * rdec;
			recycled += i / dec;
			if (recycled > i && recycled <= B) {
				rval++;
			}			
		}
		return rval;
	}
}
