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

import java.io.BufferedReader;
import java.io.FileNotFoundException;
import java.io.FileReader;
import java.io.IOException;
import java.util.StringTokenizer;

/**
 * Google Code Jam 2012 C - Recycled Numbers
 * 
 * @author Ruli Manurung (maruli@cs.ui.ac.id)
 */
public class QC
{
	public static void main(String[] args) throws FileNotFoundException,
			IOException
	{
		String fileName = args[0];
		BufferedReader input = new BufferedReader(new FileReader(fileName));

		StringTokenizer token = new StringTokenizer(input.readLine());
		int t = Integer.parseInt(token.nextToken());

		for (int ii = 0; ii < t; ii++)
		{
			token = new StringTokenizer(input.readLine());
			int a = Integer.parseInt(token.nextToken());
			int b = Integer.parseInt(token.nextToken());
			
			int recycled = 0;
			
			for(int jj=a; jj<b; jj++)
				for(int kk=jj+1; kk<=b; kk++)
					if(recyclable(jj,kk)) recycled++;
					
			System.out.println("Case #" + (ii + 1) + ": "
					+ recycled);
		}
		input.close();
	}
	
	static boolean recyclable(int jj, int kk)
	{
		String sjj = jj+"";
		int length = sjj.length();
		for(int ii=1; ii<sjj.length(); ii++)
		{
			String nu = sjj.substring(length-ii) + sjj.substring(0, length-ii);
			if(Integer.parseInt(nu)==kk) return true;
		}
		return false;
	}
}
