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

}
// Recycled Numbers

import java.io.*;
import java.util.*;

public class RecycledNumbers {
	public static void main(String[] args) throws Exception {
		String inputPath = args[args.length-2];
		String outputPath = args[args.length-1];
		
		BufferedReader br = new BufferedReader(new FileReader(inputPath));
		int numberOfTestCases = Integer.parseInt(br.readLine());
		
		StringBuilder output = new StringBuilder();
		
		for (int i=1; i<=numberOfTestCases; i++) {
			String[] components = br.readLine().split(" ");
			int minValue = Integer.parseInt(components[0]);
			int maxValue = Integer.parseInt(components[1]);
			
			int numberOfPairs = 0;
			
			ArrayList<String> list = new ArrayList<String>();
			
			for (int value=minValue; value<=maxValue; value++) {
				String vString = Integer.toString(value);
				if (list.indexOf(vString) == -1) {
					boolean mainItemAdded = false;
					int numberOfSubpairs = 0;
					int vStringLength = vString.length();
					for (int vStringIndex=1; vStringIndex<vString.length(); vStringIndex++) {
						StringBuilder sb = new StringBuilder(vString);
						String part = sb.substring(0, vStringIndex);
						sb.delete(0, vStringIndex);
						sb.append(part);
						
						String newValueString = sb.toString();
						int newValue = Integer.parseInt(newValueString);
						int newValueLength = Integer.toString(newValue).length();
						if ((vStringLength==newValueLength) && (vString.equals(newValueString) == false) && (list.indexOf(newValueString) == -1) && (newValue >= minValue) && (newValue <= maxValue)) {
							if (mainItemAdded == false) {
								mainItemAdded = true;
								list.add(vString);
//								System.out.println(vString);
								numberOfSubpairs++;
							}
							numberOfSubpairs++;
							list.add(newValueString);
//							System.out.println(newValueString);
						}
					}
					for (int s=numberOfSubpairs-1; s>0; s--) {
						numberOfPairs+=s;
					}
//					System.out.println("Pair: " + numberOfPairs + " Sub: " + numberOfSubpairs);
				}
			}
			System.out.println("Case #" + i + ": " + numberOfPairs + "\n");
			output.append("Case #" + i + ": " + numberOfPairs + "\n");
		}
		
		BufferedWriter bw = new BufferedWriter(new FileWriter(outputPath));
		String outputString = output.toString();
		bw.write(outputString, 0, outputString.length());
		bw.close();
	}
}