
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 Recycled
{
	public static void main(String[] sArgs)throws IOException
	{
		Scanner oScan = new Scanner(new File("recycled.in"));
		PrintWriter out = new PrintWriter("recycled.out");

		int o_0 = oScan.nextInt();oScan.nextLine();
		for(int o_o=1;o_o<=o_0;o_o++)
		{
			int A = oScan.nextInt(),B=oScan.nextInt();
			int count=0,base=0;
			for(int i=1;i<=A;i*=10)base+=i;
			for(int i=A;i<B;i++)
			{
				String s = new String(i+"");
				ArrayList<Integer> nums = new ArrayList<Integer>();
				if(i%base==0)
				{
					//System.out.println("same "+i);
					continue;
				}
				for(int j=1;j<s.length();j++)
				{
					String newS = s.substring(j)+s.substring(0,j);
					if(newS.charAt(0)=='0')continue;
					int rec = new Integer(newS);
					if(rec>i&&rec<=B&&!nums.contains(rec)){count++;nums.add(rec);}
				}
			}
			out.println("Case #"+o_o+": "+count);
		}

		out.close();
	}
}