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

import inout.In;
import inout.Out;

public class Main {

    public static void main(String[] args) throws Exception {
        String[] strings = In.read("C-small-attempt1.in", 1);
        int n = 1;
        for (String s : strings) {
            long cont = 0;
            String[] split = s.split(" ");
            long min = Long.parseLong(split[0]);
            long max = Long.parseLong(split[1]);
            if ((min + "").length() > 1) {
                for (long i = min; i < max; i++) {
                    String newstr1 = "" + i;
                    ext: for (long j = i + 1; j <= max; j++) {
                        String newstr2 = "" + j;
                        for (int k = newstr1.length() - 1; k > 0; k--) {
                            String str = newstr1.substring(k) + newstr1.substring(0, k);
                            if (str.equals(newstr2)) {
                                cont++;
                                continue ext;
                            }
                        }
                    }
                }
            }
            Out.write("output.txt", n++, cont + "");
        }
    }
}
