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

}


public class Pair2 {
    public int left;
    public int right;
    
    public Pair2(int left, int right) {
        this.left = left;
        this.right = right;
    }
    
    @Override
    public boolean equals(Object other) {
        if (!(other instanceof Pair2)) {
            return false;
        }
        
        Pair2 pOther = (Pair2) other;
        return (left == pOther.left && right == pOther.right);
    }
    
    @Override
    public String toString() {
        return left + " " + right;
    }

    @Override
    public int hashCode() {
        return left * 100001 + right;
    }
    
    
}
