
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 C {
	public static void main(String[] args) {
		try 
		{
			Scanner input = new Scanner(new FileReader("C.in"));
			PrintWriter output = new PrintWriter(new FileWriter("C.out"));
			try
			{
				int i = Integer.parseInt(input.nextLine());
				for(int j=0; j<i; j++)
				{
					int num = j+1;
					int a = input.nextInt();
					int b = input.nextInt();
					output.println("Case #" + num + ": " + recycle(a, b));
				}
			}
			catch(Exception ex) { System.out.println("Error"); }
			finally
			{
				input.close();
				output.close();
			}
		}
		catch(Exception ex) { System.out.println("Error"); }
	}
	
	public static String recycle(int a, int b)
	{
		int num = 0;
		for(int i=a; i<=b; i++)
		{
			for(int j=i+1; j<=b; j++)
			{
				if(recycled(i,j)) num++;
			}
		}
		
		return Integer.toString(num);
	}
	
	public static boolean recycled(int i, int j)
	{
		String a = Integer.toString(i);
		String b = Integer.toString(j);
		
		int check = 1;
		while(check<a.length())
		{
			char temp = b.charAt(b.length()-1);
			b = temp + b.substring(0, b.length()-1);
			if(a.equals(b)) 
			{
				System.out.println(i + " " + j);
				return true;	
			}
			check++;
		}
		return false;
	}
}