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.util.*;
import java.io.*;
import java.text.*;

public class Q {
	private static long solve(int from, int to) {
		int[] flag = new int[2000001];
		long res = 0;
		int t=from/10, b = 1; 
		while (t>0) {
			b*=10;t/=10;
		}
		for (int i = from; i < to; ++i) {
			t = i;			
			do {
				t = (t /10) + (t%10 * b);
				if (t > i && t<= to && flag[t] != i + 1) {
					flag[t] = i + 1;
					++res;
				}				
			} while (t != i);			
		}
		return res;
	}
	
	public static void main(String[] args) throws Exception {
		Scanner in = new Scanner(new File("input.txt"));
		PrintStream out = new PrintStream("output.txt");
		
		int num = in.nextInt();
		in.nextLine();
		for (int i=0;i<num;++i) {
			int from = in.nextInt();
			int to = in.nextInt();			
			StringBuilder builder = new StringBuilder("Case #" +(i+1)+": ");
			builder.append(solve(from, to));
			System.out.println(builder.toString());
			out.println(builder.toString());
		}
		
		in.close();
		out.close();
	}	
}
