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.*;
import java.util.*;
import java.math.*;
public class recycle
{
	static int A=0;
	static int B=0;
	static int C=0;
	static int T=0;
	static int ans=0;
	static HashSet<Integer> ansset= new HashSet<Integer>();
	public static void main(String[] args)
	{
		Scanner scan= new Scanner(System.in);
		
		T=scan.nextInt();
		
		for(int i=1; i<=T; i++)
		{
			A=scan.nextInt();
			B=scan.nextInt();
			String s1="";
			C=0;
			ans=0;
			
			if(B>10)
			for(int n=A; n<B; n++)
			{
				s1=n+"";
				String t1="";
				String t2="";
				ansset.clear();
				for(int j=1; j<=s1.length(); j++)
				{
					t1=s1.substring(0,j);
					t2= s1.substring(j);
					C= Integer.parseInt(t2+t1);
			//		System.out.println(C);
					if(C>n && C<=B)
						ansset.add(C);
				}
				ans+=ansset.size();
			}
			
			System.out.println("Case #"+i+": "+ans);
		}
	}

}