
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.util.Scanner;
import java.util.TreeSet;


public class RecycledNumbers {

	public static void main(String[] args) {

		Scanner s = new Scanner(System.in);
		int numCases = s.nextInt();
		s.nextLine();
		for (int i = 0; i < numCases; i++) {
			TreeSet<Integer> found = new TreeSet<>();
			int count = 0;
			int a = s.nextInt();
			int b = s.nextInt();
			String bStr = b + "";
			for (int n = a; n < b; n++) {
				String numStr = n + "";
				for (int j = 1; j < numStr.length(); j++) {
					if (numStr.charAt(j) < numStr.charAt(0)) {
						continue;
					}
					if (numStr.length() == bStr.length() && numStr.charAt(j) > bStr.charAt(0)) {
						continue;
					}
					String numRot = numStr.substring(j) + numStr.substring(0, j);
					int m = Integer.parseInt(numRot);
					//System.out.println("DEBUG: Trying " + n + "," + m);
					if (n < m && m <= b) {
						found.add(m);
						//System.out.println("DEBUG: Found");
					}
				}
				count += found.size();
				found.clear();
			}
			System.out.println("Case #" + (i+1) + ": " + count);
		}
	}

}
