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

import java.io.BufferedReader;
import java.io.File;
import java.io.FileReader;
import java.io.FileWriter;
import java.io.IOException;
import java.util.HashMap;

public class Main3 
{
	static HashMap<String,String> pairsMap = new HashMap<String,String>();
	
	protected static String resolveTestCase(String line)
	{
		String [] tokens = line.split(" ");
		
		int A = Integer.parseInt(tokens[0]);
		int B = Integer.parseInt(tokens[1]);
		
		int pairs = 0;
		
		pairsMap.clear();
		
		for ( int n = A; n <= B; n++ )
		{
			String test = Integer.toString(n);
			
			for ( int j = 1; j < test.length(); j++ )
			{
				String test2 = test.substring(j, test.length()) + test.substring(0, j);
				
				int m = Integer.parseInt(test2);
				
				if ( test2.charAt(0) != '0' && n < m && m <= B && pairsMap.get(test+test2) == null)
				{
					System.out.println("N = " + n + " M = " + m );
					
					pairs++;
					
					pairsMap.put(test+test2, "");
				}
			}
		}
		
		return "" + pairs;
	}
	
	public static void main (String [] args) throws IOException
	{
		String inputFile = args[0];
		
		File f = new File(inputFile);
		FileReader fr = new FileReader(f);
		BufferedReader br = new BufferedReader(fr);
		
		File f2 = new File(inputFile + ".out");
		FileWriter fw = new FileWriter(f2);

		String line = br.readLine();
		
		int count = Integer.parseInt(line);

		// resolve test cases
		int testcase = 1;
		
		for(int tests = 0; tests < count; tests++)
		{
			line = br.readLine();
			
			System.out.println(line);

			String output = "Case #"+testcase+": ";
			
			output += resolveTestCase(line);
			
			System.out.println(output+"\n");
			fw.write(output+"\r\n");
			
			testcase++;
		}
		
		fw.close();
		
	}
}
