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.*;
public class C {

	/**
	 * @param args
	 */
	public static void main(String[] args) {
		// TODO Auto-generated method stub
		Scanner in = new Scanner(System.in);
		int T = in.nextInt();
		int i,j,len,p,temp,total;
		HashSet<Integer>[] map = new HashSet[2000000];
		for (i=1;i<2000000;i++) {
			map[i] = new HashSet<Integer>();
			len = (int)Math.log10(i)+1;
			p = (int)Math.pow(10, len-1);
			temp = i;
			for (j=0;j<len-1;j++) {
				temp = (temp%10)*p+temp/10;
				if (temp>i && temp<=2000000)
					map[i].add(temp);
			}
		}
		for (i=1;i<=T;i++) {
			int a = in.nextInt();
			int b = in.nextInt();
			total = 0;
			for (j=a;j<b;j++) {
				for (Integer t : map[j]) {
					if (t>j && t<=b)
						total++;
				}
			}
			System.out.println("Case #"+i+": "+total);
		}
	}

}
