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 be.tim.recycled;

/**
 *
 * @author Tim Boeckstaens
 * @version 1.0
 */
public class Recycler {
    public String process(String line) {
        String[] split = line.split(" ");

        if(split.length != 2){
            throw new IllegalArgumentException("Foute regel");
        }

        int a = Integer.parseInt(split[0]);
        int b = Integer.parseInt(split[1]);

        int counter = 0;

        for(int i = a ; i < b; i++){

            for(int j = i + 1; j <= b; j++){
                String s = i + "";
                String t = j + "";
                char[] chars = s.toCharArray();

                for(int x = 1; x < chars.length; x++){
                    char[] result = new char[chars.length];
                    int index = 0;
                    int start = chars.length - x;
                    for(int copy = start; copy < chars.length; copy++){
                        result[index++] = chars[copy];
                    }
                    for(int end = 0; end < start; end++){
                        result[index++] = chars[end];
                    }
                    if(new String(result).equals(t)){
                        counter++;
                        break;
                    }
                }

            }

        }

        return counter + "";
    }
}

