
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 scanner = new Scanner(System.in);
		int numTestCases = Integer.valueOf(scanner.nextLine());
		for ( int i =0; i < numTestCases; i++ ) {
			String theCase = scanner.nextLine();
			//Error checking not necessary for now.

			Scanner lineScanner = new Scanner(theCase);
			int A = lineScanner.nextInt();
			int B = lineScanner.nextInt();
			int numDigits = getNumDigits(A,B);
			int[] powersOf10 = new int[numDigits];
			powersOf10[0] =1;
			for ( int j =1; j < numDigits; j++) {
				powersOf10[j] = powersOf10[j-1]*10;
			}
			//Brute force
			int count=0;
			for ( int number = A; number <=B; number ++ ) {
				int[] acceptedPairs = new int[numDigits]; // Defaults to 0
				for ( int firstDigit = 1; firstDigit < numDigits; firstDigit++ ) {
					//Make a new number.
					int newNum = (number%powersOf10[firstDigit])*powersOf10[numDigits-firstDigit] + number/powersOf10[firstDigit];
					if ( newNum > B || newNum <= number) {
						continue;
					}
					for ( int j=0; j < acceptedPairs.length; j++) {
						if ( acceptedPairs[j] == newNum ) {
							//Duplicate number
							break;
						} else if ( acceptedPairs[j] == 0 ) {
							//New number
							acceptedPairs[j] = newNum;
							break;
						}
					}
				}
				// Count non-zero accepted pairs
				for ( int j = 0; j < acceptedPairs.length; j++ ) {
					if ( acceptedPairs[j] == 0 ) {
						break;
					}
					count++;
				}
			}
			StringBuilder builder = new StringBuilder("Case #");
			builder.append(i+1).append(": ");
			builder.append(count);
			System.out.println(builder.toString());
		}
	}

	private static int getNumDigits(int a, int b) {
		int count = 0;
		while ( a > 0) {
			count++;
			a /= 10;
		}
		return count;
	}

}
