
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.*;
import java.util.StringTokenizer;

public class RecycledNumbers {
	public static void main(String[] args) {
		try {
			BufferedReader ifStream = new BufferedReader(new FileReader("C.in"));
			PrintWriter ofStream = new PrintWriter(new FileWriter("C.out"));
			int numCase;
			String inputCase;

			numCase = Integer.parseInt(ifStream.readLine());
			for (int i=1; i<=numCase; i++) {
				ofStream.println("Case #"+i+": "+recycledNumbers(ifStream.readLine()));
			}

			ifStream.close();
			ofStream.close();
		}
		catch (IOException e) {
			System.out.println("IOException.");
		}
	}

	private static int  recycledNumbers(String input) {
		StringTokenizer st = new StringTokenizer(input, " ", false);
		int A = Integer.parseInt(st.nextToken());
		int B = Integer.parseInt(st.nextToken());
		int numDigits = String.valueOf(A).length();
		int[] mArr = new int[numDigits];
		int count, m;
		int result = 0;

		for (int n=A; n<B; n++) {
			count = 0;
			for (int i=1; i<numDigits; i++) {
				m = shiftInt(n, i);
				if (m > n && m <= B) {
					mArr[count++] = m;
				}
			}
			result += count;
			for (int i=0; i<count; i++) {	// redundancy check
				for (int j=i+1; j<count; j++) {
					if (mArr[j] == mArr[i]) {
						result--;
						mArr[j] = 0;
					}
				}
			}
		}

		return result;
	}

	private static int shiftInt(int num, int k) {
		String before = String.valueOf(num);
		String after = before.substring(k, before.length()) + before.substring(0, k);

		return Integer.parseInt(after);
	}
}
