
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.util.*;
import java.io.*;

public class Solution {
	public void doMain() throws Exception {
		Scanner sc = new Scanner(new FileReader("/home/vivek/workspace/codejam2012problem2/src/input.txt"));
		PrintWriter pw = new PrintWriter(new FileWriter("/home/vivek/workspace/codejam2012problem2/src/output.txt"));
		//Scanner sc = new Scanner(System.in);
		//PrintWriter pw = new PrintWriter(System.out);
		int T = sc.nextInt();
		//sc.nextLine();		
		for (int j = 0; j < T; j++) {
			long a = sc.nextLong();
			long b = sc.nextLong();
			int count=0;
			pw.print("Case #" + (j + 1) + ": ");			
			for(long i=a;i<=b;i++){
				String N=i+"";
				String M=i+"";int n=M.length();				
				int check=0;
				List<Long> al=new ArrayList<Long>();
				for(int k=0;k<n;k++){					
					M=M.charAt(n-1)+M;
					M=M.substring(0,n);	
					if(!al.contains(new Long(Long.parseLong(M))) &&  Long.parseLong(M)<=b && Long.parseLong(N)<Long.parseLong(M) && a<Long.parseLong(M))
						count++;
					al.add(Long.parseLong(M));
					
				}							
			}			
			pw.println(count);
		}		
		pw.flush();
		pw.close();
		sc.close();
	}
	
	public static void main(String[] args) throws Exception {
		new Solution().doMain();
	}
}