
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.ArrayList;
import java.util.List;


public class RecycledNumbers {

	private int A;
	private int B;
	
	public RecycledNumbers(int A, int B) {
		this.A = A;
		this.B = B;
	}
	
	public int calculate() {
		int result = 0;
		int digitCount = Integer.toString(A).length();
		
		if (digitCount == 1) return 0;
		
		List<String> numbers = new ArrayList<String>();
		for (int i = A; i < B + 1; i++) {
			numbers.add(Integer.toString(i));
		}
		
		for (int i = 0; i < numbers.size(); i++) {
			String number = numbers.get(i);
			
			for (int j = 1; j < digitCount; j++) {
				String reverseNumber = number.substring(j) + number.substring(0, j);
				int reversInt = Integer.parseInt(reverseNumber);
				
				if ((reversInt <= B) && (reversInt > Integer.parseInt(number))) {
//					System.out.println("A(" + A + ") <= " + number + " < " + reverseNumber + " <=B(" + B + ")");
					result++;
				}
			}
		}
		
		return result;
	}
	
	public static List<RecycledNumbers> parseFromFile(List<String> readInput) {
		List<RecycledNumbers> result = new ArrayList<RecycledNumbers>();
		int testCaseCount = Integer.parseInt(readInput.get(0));

		for (int i = 0; i < testCaseCount; i++) {
			String line[] = readInput.get(i + 1).split(" ");

			result.add(new RecycledNumbers(Integer.parseInt(line[0]), Integer.parseInt(line[1])));
		}

		return result;
	}
	
	@Override
	public String toString() {
		return "A = " + A + "; B = " + B;
	}
}
