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

}
package qualifying;

import java.util.*;

public class RecycledNumbers {
	
	public static void main(String[] args) {
		Scanner in = new Scanner(System.in);
		
		final int NUM_TESTS = in.nextInt();
		for (int t = 1; t <= NUM_TESTS; ++t) {
			final int A = in.nextInt();
			final int B = in.nextInt();
			
			final int numDigits = Integer.toString(A).length();
			
			Set<String> pairs = new HashSet<String>();
			for (int n = A; n < B; ++n) {
				for (int i = 1; i < numDigits; ++i) {
					int m = recycle(n, i);
					if (n < m && m <= B)
						pairs.add(n + "," + m);
				}
			}
			
			System.out.println("Case #" + t + ": " + pairs.size());
		}
		
	}
	
	
	// Recycles n by moving the first i digits to the back
	private static int recycle(int n, int i) {
		String iStr = Integer.toString(n);
		String newStr = iStr.substring(i) + iStr.substring(0,i);
		return Integer.parseInt(newStr);
	}
}