
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.File;
import java.io.FileReader;
import java.util.HashSet;
import java.util.Set;

/**
 * 
 */

/**
 * @author Kamlesh Saran Dev
 * 
 */
public class RecycledPair {

	int a;
	int b;

	/**
	 * @param i
	 * @param j
	 */
	public RecycledPair(int a, int b) {
		this.a = a;
		this.b = b;
	}

	/**
	 * @return
	 */
	public int getNumberOfPairs() {
		int count = 0;
		for (int n = a; n < b; n++) {
			Set<Integer> allCombinations = giveAllCombinations(n, b);
			count = count + allCombinations.size();
		}
		return count;
	}

	/**
	 * @param n
	 * @return
	 */
	private Set<Integer> giveAllCombinations(int n, int b) {
		Set<Integer> result = new HashSet<Integer>();
		String nStr = Integer.toString(n);
		for (int i = 1; i < nStr.length(); i++) {
			String backPart = nStr.substring(i);
			String frontPart = nStr.substring(0, i);
			int newNumber = Integer.valueOf((backPart + frontPart));

			if (n < newNumber && newNumber <= b) {
				result.add(newNumber);
			}
		}
		return result;
	}

	public static void main(String args[]) throws Exception {
		BufferedReader bufferedReader = new BufferedReader(
				new FileReader(
						new File(
								"C:\\Documents and Settings\\Kamlesh\\Desktop\\codejam\\C-small-attempt0.in")));
		int numberOfTest = Integer.valueOf(bufferedReader.readLine());
		for (int i = 1; i <= numberOfTest; i++) {
			String line = bufferedReader.readLine();
			String limits[] = line.split("\\ ");
			RecycledPair rp = new RecycledPair(Integer.valueOf(limits[0]), Integer.valueOf(limits[1]));
			System.out.println("Case #" + i + ": " +  rp.getNumberOfPairs());

		}
	}

}
