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

public class C {
		
	public static void main(String[] args){
		
		Scanner in = new Scanner(System.in);
		
		int T = in.nextInt();
		in.nextLine();
		
		for(int line = 1; line <= T; line++){ // loop through lines
			String numbers = in.nextLine();
			int spaceIndex = numbers.indexOf(' ');
			int lowerLimit = Integer.parseInt(numbers.substring(0, spaceIndex));
			int upperLimit = Integer.parseInt(numbers.substring(spaceIndex + 1));
			int numberOfDigits = spaceIndex;
			
			int pairs = 0;
			for(int swooper = lowerLimit; swooper < upperLimit; swooper++){
				for(int cycler = swooper + 1; cycler <= upperLimit; cycler++){
					// Convert to char array for manipulation
					char[] digits = Integer.toString(cycler).toCharArray();
					for(int offset = 1; offset < numberOfDigits; offset++){
						// Rotate
						char firstElement = digits[0];
						for(int i = 0; i < numberOfDigits - 1; i++){
							digits[i] = digits[i+1];
						}
						digits[numberOfDigits - 1] = firstElement;
						// Convert back to an int and compare
						int cycledCycler = Integer.parseInt(new String(digits));
						if(cycledCycler == swooper){
							//System.out.format("A match! %d and %d!\n", swooper, cycler);
							pairs++;
							break;
						}
					}
				}
			}
			
			System.out.format("Case #%d: %d\n", line, pairs);
		}
	}
}
