
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 RecNum {
	public static void main(String[] args) {
		Scanner reader = new Scanner (System.in);
		int nCases = reader.nextInt();
		for(int i=1; i<=nCases; i++) {
			int A = reader.nextInt();
			int B = reader.nextInt();
			int digits = 0;
			int nPair = 0;
			int tmp = A;
			while(tmp > 0) {
				digits++;
				tmp = tmp/10;
			}
			for(int j=A; j<=B; j++) {
				for(int k=1; k<digits; k++) {
					int divider = new Double(Math.pow(10, k)).intValue();
					int timer = new Double(Math.pow(10, digits-k)).intValue();
					int last = j%divider;
					int newInt = last*timer + j/divider;
					if(newInt>j && newInt<=B) {
						nPair++;
					}
				}
			}
			System.out.println("Case #" + i + ": " + nPair);
		}
	}
}
