
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 Recycle {

	/**
	 * @param args
	 */
	public static void main(String[] args) {
		Scanner sc = new Scanner(System.in);
		int numLines = sc.nextInt();
		int lineCounts = 1;
		
		while (numLines > 0) {
			String A = sc.next();
			String B = sc.next();
//			System.out.println(A + " " + B);
			
			int result = findRecyclePairs(A, B);
			System.out.println("Case #" + lineCounts + ": " +result);
			numLines--;
			lineCounts++;
		}

	}

	private static int findRecyclePairs(String a, String b) {
		
		int result = 0;
		int strLength = a.length();
		int pos;
		int num1 = Integer.parseInt(a);
		int num2 = Integer.parseInt(b);
		int i;
		int j;
		String str1;
		String str2;
		String strTemp;
		String front;
		
		
		if (strLength > 1) {
			
			for (i = num1; i < num2; i++) {
				str1 = Integer.toString(i);
				for (j = i+1; j <= num2; j++) {
					str2 = Integer.toString(j);
					for (pos = 1; pos < strLength; pos++) {
						strTemp = str1.substring(pos);
						front = str1.substring(0, pos);
//						System.out.println(str2+ " " + front);
						
						strTemp = strTemp.concat(front);
//						System.out.println("Str2: "+ str2);
						
						if (!str2.startsWith("0") && !str1.startsWith("0")) {
							if (strTemp.equals(str2)) {
								result++;
							}
						}
					}
				}
			}
			
		}
		
		return result;
	}
	
	
}
