import java.util.Scanner;
import java.io.*;
import java.lang.Math;


public class C{
	public static int recycle(String str){
		String[] numbers = str.split(" ");
		int min = Integer.parseInt(numbers[0]);
		int max = Integer.parseInt(numbers[1]);
		int ret = 0;

		for(int i = min; i < max; i++){
			String num = i + "";
			int len = num.length();
			int k = i;
			for(int j = 1; j < len; j++){
				k = (k/10) + (int)java.lang.Math.pow(10.0,(double)(len-1))*(k%10);
				if (k > i && k <= max)
					ret++;
				else if(k == i)
					break;
			}
		}

		return ret;
	}

	public static void main(String[] args){
		Scanner sc = null;
		String next;
		int out;
		try{
			sc = new Scanner(new File("C-large.in"));
			int cases = Integer.parseInt(sc.nextLine());
			int current = 0;
			

			FileWriter fs = new FileWriter("output.txt");
			BufferedWriter buff = new BufferedWriter(fs);
			while(current < cases){
				next = sc.nextLine();
				current++;
				out = recycle(next);
				buff.write("Case #" + current + ": " + out + "\n");
			}
			buff.close();
		}
		catch(Exception ex){}
	}
}
import java.io.File;
import java.util.*;

public class ProblemCLarge {

	public static void main(String[] args) throws Exception {

		// Scanner sc = new Scanner(new File("C:\\C-Large.in"));
		Scanner sc = new Scanner(System.in);
		int cases = Integer.parseInt(sc.nextLine().trim());
		for (int i = 0; i < cases; i++) {
			int a = sc.nextInt();
			int b = sc.nextInt();
			System.out.println("Case #" + (i + 1) + ": " + solve(a, b));
		}
	}

	private static int solve(int a, int b) {
		int count = 0;
		int num_digs = ("" + a).length();
		int[] power = new int[] { 1, 10, 100, 1000, 10000, 100000, 1000000,
				10000000 };

		for (int i = a; i <= b; i++) {
			int[] tmp = new int[10];
			int cnt = 0;

			for (int j = 1; j < num_digs; j++) {
				boolean found = false;
				
				if (i % power[j] > 0) {
					int tmp1 = (i % power[j]) * power[num_digs - j];

					int tmp2 = (i - (i % power[j])) / power[j];

					int tmp3 = tmp1 + tmp2;

					if (cnt == 0) {
						tmp[cnt++] = tmp3;
					} else {
						for (int k = 0; k < cnt; k++) {
							if (tmp3 == tmp[k]) {
								found = true;
							}
						}
						if(!found){
							tmp[cnt++] = tmp3;
						}
					}
				}
			}

			for (int tmp4 : tmp) {
				if (tmp4 >= a && tmp4 <= b && tmp4 != i) {
					//System.out.println(i + " " + tmp4);
					count++;
				}
			}
		}

		return count / 2;
	}

}
