
import java.util.Scanner;
import java.util.Set;
import java.util.TreeSet;
import java.io.File;
import java.io.IOException;
import java.io.FileWriter;
import java.io.BufferedWriter;

public class Recycle
{
	public static void main(String[] args)
	{
/*		Set<Integer> perms = getPermutations(123456);
		
		for(Integer i: perms)
			System.out.println(i);*/
	
		try
		{
			Scanner s = new Scanner(new File("recycle.in"));
			BufferedWriter w = new BufferedWriter(new FileWriter(new File("recycle.out")));
			int numCases = s.nextInt();
			s.nextLine();
			
			for(int n = 1;n <= numCases; n++)
			{
				int A = s.nextInt();
				int B = s.nextInt();
				int count = 0;
				for(int k = A; k <= B; k++)
				{
					count += getNumPairs(k, B);
				}
				
				w.write("Case #" + n + ": " + count + "\n");
			}
			
			w.flush();
			w.close();
		}
		catch (IOException e)
		{
			e.printStackTrace();
		}
	}
	
	public static int getNumPairs(int n, int B)
	{
		Set<Integer> possibles = getPermutations(n);
		int count = 0;
		for(Integer i : possibles)
			if(i > n && i <= B)
				count++;
		return count;
	}
	
	public static Set<Integer> getPermutations(int n)
	{
		Set<Integer> perms = new TreeSet<Integer>();
		char[] digits = String.valueOf(n).toCharArray();
		
		for(int firstPos = 1; firstPos < digits.length; firstPos++)
		{
			String toBuild = "";
			for(int k = 0; k < digits.length; k++)
				toBuild += digits[(firstPos + k) % digits.length];
			perms.add(Integer.parseInt(toBuild));
		}
		return perms;
	}
	

}
import java.io.File;
import java.io.PrintWriter;
import java.util.Scanner;

public class EasyNumbers { 
	public static void main(String[] args) throws Exception{
		PrintWriter out =new PrintWriter(new File("../easyNumbers/src/numberrr.out"));
		Scanner s =new Scanner(new File("../easyNumbers/src/number.in"));
		int ans,div,d,k,n1,n2,j,a,a1,b;
		int i,t;
		t = s.nextInt();
		for(int w = 1; w<=t; w++){
			a = s.nextInt();
			b = s.nextInt();
			ans=0;
			i=0;
			a1 = a;
			while(a1!=0){
				a1/=10;
				i++;
			}
			for(j=a;j<=b;j++){
				n2=j;
				for(k=0;k<i-1;k++){
					n1 = j;
					div = 1;
					while(n1 > 9){
						n1 = n1 / 10;
						div = div * 10;
					}
					d = n2 % 10;
					n2 = n2 / 10;
					n2 = n2 + d * div ;
					if(n2<=b && n2>=a && n2!=j && j<n2)
						ans++;                           
					if(n2==j)
						break;
				}
			}
		System.out.println("Case #"+ w +  ": " +ans);
		}
	}
}