
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.Hashtable;
import java.util.Scanner;

class RecycleResult{
	private int lowerBound, upperBound, numberOfDigits;
	public RecycleResult(int a, int b, int d){
		lowerBound = a;
		upperBound = b;
		numberOfDigits = d;
	}
	public int solve(){
		int count = 0;
		for (int i = lowerBound; i < upperBound; i++){
			int p = i;
			Hashtable<Integer, Integer> hash = new Hashtable<Integer, Integer>();
			for (int j = 1; j < numberOfDigits; j++){
				p = moveToFront(p);
				if ((p <= upperBound) && (p > i) && (!(p == i)) && (!(hash.containsValue(p)))){
					count++;
					hash.put(count, p);
				}
			}
		}
		return count;
	}
	public int moveToFront(int z){
		int lastDigit = z % 10;
		int otherDigits = (z / 10);
		for (int i = 0; i < numberOfDigits - 1; i++){
			lastDigit = lastDigit * 10;
		}
		return otherDigits + lastDigit;
	}
}
public class Recycle {
	public static void main(String[] args) {
		int numberOfCases;
		Scanner myScanner = new Scanner(System.in);
		int a, b;
		numberOfCases = myScanner.nextInt();
		RecycleResult myResult;
		
		for (int i = 0; i < numberOfCases; i++){
			a = myScanner.nextInt();
			b = myScanner.nextInt();
			int length = String.valueOf(a).length();
			myResult = new RecycleResult(a, b, length);
			int count = myResult.solve();
			System.out.println("Case #" + (i+1) + ": " + count);
		}
	}
}
