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.io.FileNotFoundException;
import java.io.PrintWriter;
import java.util.ArrayList;
import java.util.Scanner;


public class Prob3 {

	/**
	 * @param args
	 * @throws FileNotFoundException 
	 */
	public static void main(String[] args) throws FileNotFoundException {
		Scanner scan = new Scanner(new File("C-small-attempt0.in"));
		PrintWriter output = new PrintWriter(new File("output3.txt"));
		String result = "";
		int tests = scan.nextInt();
		for(int t = 0; t < tests; t++){
			int A = scan.nextInt();
			int B = scan.nextInt();
			int count  = 0;
			for(int run = A; run <= B; run++){
				String m = new Integer(run).toString();
				for(int i = 0; i < m.length()-1; i++){
					int n = Integer.parseInt(m.substring(i+1) + m.substring(0, i+1));
					if(n <= B && n >= A){
						if(n == run);
						else{
							count++;
						}
					}
				}
			}
			System.out.print("Case #" + (t+1) + ": " + (count/2)+"\n");
			result += "Case #" + (t+1) + ": " + (count/2)+"\n";
		}
		output.write(result);
		output.close();
	}

}
