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.Scanner;


public class RecycledNumbers {

	public static int Recycled(int k,int begin,int end){
		int length =String.valueOf(k).length();
		int inc=0;
		int con=(int) Math.pow(10,length);
		int div=1;
		int temp;
		for(int i=1;i<length;i++){
			div*=10;
			con/=10;
			temp=(k%div)*con+(k/div);
			if(temp>k){
			if(temp>=begin&&temp<=end){
				inc++;
			}
			}
		}
		return inc;
	}
	public static int testcase(int begin,int end){
		int inc=0;
		for(int i=begin;i<=end;i++){
			inc+=Recycled(i,begin,end);
		}
		return inc;
	}
	public static void main(String[] args) {
		Scanner scan = new Scanner(System.in);
		int T = scan.nextInt();
		for(int i=0;i<T;i++){
			System.out.println("Case #"+(i+1)+": "+testcase(scan.nextInt(),scan.nextInt()));
		}
	}

}
