
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.Scanner;


public class Main {

	/**
	 * @param args
	 */
	public static void main(String[] args) {

		Scanner scan = new Scanner(System.in);
		int cases = scan.nextInt();
		scan.nextLine();
		String phrase;
		int i = 1;
		while (scan.hasNextLine()) {
			int n1 = scan.nextInt();
			int n2 = scan.nextInt();
			System.out.println("Case #"+i+++": "+recycle(n1,n2));
		}	
	}

	public static int recycle(int n1, int n2){
		int count = 0;
		for(int i = n1; i<n2; i++){
			for(int j = i+1; j<=n2; j++){
				if(moveComp(i, j))
					count++;
			}
		}
		return count;
	}

	public static boolean moveComp(int n1, int n2){
		String num1 = Integer.toString(n1);
		String num2 = Integer.toString(n2);
		if(num1.length() != num2.length()) return false;
		for(int i = 0; i <num2.length(); i++){
			if(num2.equals(num1))
				return true;
			num2 = num2.charAt(num2.length()-1)+num2.substring(0, num2.length()-1);

		}
		return false;
	}
}
