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.*;
import java.io.*;
class Try{
	
	public static int equate(String currentNumber, String reversibleNumber){
		int count=0;
		char splitPoint = currentNumber.charAt(0);
		for (int i=0;i<reversibleNumber.length();i++){
			if (reversibleNumber.charAt(i)==splitPoint){
				//we've found our pivot
				int start = i;
				String reversedWord="";
				for (int j=0;j<reversibleNumber.length();j++){
					 reversedWord+=reversibleNumber.charAt((start+j)%reversibleNumber.length());
				}
				if (reversedWord.equals(currentNumber)){
					count=1;
					break; //test
				}
			}
		}
		return count;
	}
	
	public static void main(String[] args){
		Scanner file = null;
		try{
			file = new Scanner(new FileInputStream(args[0]));
		}
		catch(Exception e){
			System.out.println(e);
			System.exit(0);
		}
		int inputSize = Integer.parseInt(file.nextLine());
		Node[] limits = new Node[inputSize];
		for (int i=0;i<inputSize;i++){
			String[] line = file.nextLine().split(" ");
			limits[i] = new Node(Integer.parseInt(line[0]),Integer.parseInt(line[1]));
		}
		int Case=1;
		for (Node Interval:limits){
			int count=0;
			int min = Interval.getMin();
			int max = Interval.getMax();
	
			for (int i=min;i<=max;i++){
				
				for (int j=min;j<=max;j++){
					if (j!=i){
						count+=equate(i+"",j+"");
					}
				}
			}
			System.out.println("Case #"+Case+": "+(count/2));
			Case++;
		}
	}
}
