
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 Recycle {
	static boolean[][] recycled = new boolean[10000][10000];

	public static void main(String[] args) {
		Scanner scan = new Scanner(System.in);

		int T = scan.nextInt();
		for (int i = 0; i < T; i++) {
			int min = scan.nextInt();
			int max = scan.nextInt();

			int count = 0;
			for (int n = min; n < max; n++) {
				int len = len(n);
				for (int m = n + 1; m < Math.min((int)Math.pow(10, len), max + 1); m++) {
					if (recycled[n][m])
						count++;
					else if (isRecycled(n, m)) {
						count++;
						if (m <= recycled.length)
							recycled[n][m] = true;
					}
				}
			}
			System.out.println("Case #" + (i + 1) + ": " + count);
		}
	}

	static int len(int a) {
		int d = 1, len = 0;
		while (a / d > 0) {
			len++;
			d *= 10;
		}
		return len;
	}

	static boolean isRecycled(int n, int m) {
		int l = len(n);
		if (l != len(m))
			return false;

		int d = 10;
		int pow = (int)Math.pow(10, l);
		while (n / d > 0) {
			if ((n % d) * (pow / d) + n / d == m)
				return true;
			d *= 10;
		}
		return false;
	}
}
