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


public class RecycledNumbers {

	/**
	 * @param args
	 * @throws Exception 
	 */
	public static void main(String[] args) throws Exception {
		Scanner sc = new Scanner(new File("C-large.in"));
		PrintWriter pw = new PrintWriter("C-large.out");
		
		int tc = sc.nextInt();
		for(int t=1; t<=tc; t++){
			int A = sc.nextInt();
			int B = sc.nextInt();
			pw.println("Case #" + t + ": " + count(A,B));
		}
		pw.close();
		sc.close();
	}

	private static long count(int a, int b) {
		boolean[] flag = new boolean[b-a+1];
		long gsum = 0;
		for(int v=Math.max(a, 12); v<b; v++){
			long sum = 1;
			int i = v;
			if(flag[i-a]) continue;
			int exp = 1;
			while(i>0){
				i/=10;
				exp *= 10;
			}
			i = v;
			for(int e=10; e<exp; e*=10){
				int right = i%e;
				if(right < (e/10)) continue;
				int left = i/e;
				int num = right * (exp/e) + left;
				if(num == i) break;
				if(num >= a && num <= b){
					flag[num-a] = true;
					sum++;
				}
			}
			gsum += (sum*(sum-1)/2);
		}
		return gsum;
	}

}
