
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;
	}
	

}
package RecycledNumbers;

import java.io.BufferedReader;
import java.io.FileInputStream;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.ArrayList;
import java.util.List;

public class RecycledNumbers {

	public static int numCase = 0;
	public static int A = 0;
	public static int B = 0;
	
	public static void main(String[] args) throws NumberFormatException, IOException {
		
		process();		
	}
	
	public static void process() throws NumberFormatException, IOException {
		
		BufferedReader br = new BufferedReader(new InputStreamReader(
				new FileInputStream("RecycledNumbers.in")));
		numCase = Integer.parseInt(br.readLine());
		for (int i = 0; i < numCase; i++) {
			String str = br.readLine();
			String[] arr = str.split(" ");
			
			if (arr[0].length() == 1 && arr[1].length() == 1) {
				writeOut(i + 1, 0);
				continue;
			}

			A = Integer.valueOf(arr[0]);
			B = Integer.valueOf(arr[1]);
			
			if (B - A <= 5) {
				writeOut(i + 1, 0);
				continue;
			}
			
			process2(i + 1);
		}
	}
	
	public static void process2(int order) {
				
		//List<Integer> lstB = new ArrayList<Integer>();
		int count = 0;
		for (int n = A; n < B; n++) {
			if (isAllZero(n)) {
				continue;
			}
			for (int m = n + 1; m <= B; m++) {				
				if (!isAllZero(m) && isRecycledNumbers(n, m)) {
					count++;	
					//lstB.add(m);
				}
			}			
		}
		writeOut(order, count);
	}
	
	public static boolean isAllZero(int n) {
		
		int lengthN = String.valueOf(n).length();
		int dec = 1;
		for (int i = 0; i < lengthN - 1; i++) {
			dec *= 10;
		}
		if (n % dec == 0) {
			return true;
		}
		return false;
	}
	
	public static boolean isRecycledNumbers(int n, int m) {
		
		String strN = String.valueOf(n);
		String strM = String.valueOf(m);
		
		int lengthStrN = strN.length();
		for (int i = 1; i < lengthStrN; i++) {
			String prefix = strN.substring(lengthStrN - i, lengthStrN);
			if (!prefix.startsWith("0") && strM.startsWith(prefix)) {
				String t = prefix + strN.substring(0, lengthStrN - i); 
				if (t.equals(strM)) {						
					return true;
				}
			}
		}		
		return false;
	}
	
	public static void writeOut(int order, int result) {
		
		System.out.format("Case #%d: %d\n", order, result);
	}
}
