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

}

import java.util.Scanner;
import java.io.BufferedWriter;
import java.io.FileWriter;
import java.io.File;

public class C_Small {

    public static void main(String[] args) {
	try {
	    FileWriter writer = new FileWriter("C-small-attempt.out");
	    BufferedWriter out = new BufferedWriter(writer);
	    String current, result;
	    result = "";
	    Scanner sc = new Scanner(new File("C-small-attempt0.in"));
	    int l = Integer.parseInt(sc.nextLine());
	    for (int k = 0; k < l; k++) {
		result = "Case #" + (k+1) + ": ";
		current = sc.nextLine();
		int count = 0;
		String[] bounds = current.split(" ");
		int a = Integer.parseInt(bounds[0]);
		int b = Integer.parseInt(bounds[1]);
		for (int x = a; x < b; x++) {
		    String num = "" + x;
		    for (int i = 1; i < num.length(); i++) {
			String num2 = num.substring(i) + num.substring(0, i);
			int z = Integer.parseInt(num2);
			if (z <= b && z >= a && z > x) {
			    count++;
			}
		    }
		}
		result += count;
		out.write(result);
		out.newLine();
	    }
	    out.close();
	} catch (Exception e) {
	    System.out.println("error");
	}
    }

}
