
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.io.BufferedReader;
import java.io.DataInputStream;
import java.io.FileInputStream;
import java.io.InputStreamReader;
import java.util.HashSet;
import java.util.Set;

public class Recycled {
	public static void main(String[] args) throws Exception {
		FileInputStream fstream = new FileInputStream("text.in");
		// Get the object of DataInputStream
		DataInputStream in = new DataInputStream(fstream);
		BufferedReader br = new BufferedReader(new InputStreamReader(in));
		String strLine;
		int count = 0;
		int totalLines;
		// ArrayList<List> numbers = new ArrayList<List>();
		while ((strLine = br.readLine()) != null) {
			if (count == 0) {
				totalLines = Integer.parseInt(strLine);
			} else {
				int recycled = 0;
				String[] nums = strLine.split(" ");
				int startNum = Integer.parseInt(nums[0]);
				int endNum = Integer.parseInt(nums[1]);
				for (int i = startNum; i <= endNum; i++) {
					recycled += testInteger(i, endNum);
					
				}
				System.out.println("Case #" + count + ": " + recycled);
			}
			count++;
		}
		in.close();
	}

	private static int testInteger(int i, int endNum) {
		String numStr = String.valueOf(i);
		int currentCount = 0;
		Set<String> matches = new HashSet<String>();
		for (int j = 1; j < numStr.length(); j++) {
			String newNumStr = swapNumber(numStr);
			if ((Integer.parseInt(newNumStr) > i) && ((Integer.parseInt(newNumStr) <= endNum))) {
//				System.out.println(i+" "+newNumStr);
				currentCount++;
				matches.add(newNumStr);
		//	} else {
		//		return 0;
			}
			numStr = newNumStr;
		}
		return matches.size();
	}

	private static String swapNumber(String numStr) {
		String lastDigit = numStr.substring(numStr.length()-1);
		String firstDigits = numStr.substring(0, numStr.length()-1);
		return lastDigit.concat(firstDigits);
	}
	
	
}
