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

import java.io.File;
import java.io.FileNotFoundException;
import java.util.HashSet;
import java.util.Scanner;

public class RecycledNumbers 
{

	public static void main(String[] args) 
	{
		Scanner scan = null;
		try
		{
			scan = new Scanner(new File(args[0]));
		}
		catch (FileNotFoundException e)
		{
			System.err.println("File not found!");
			return;
		}
		if (!scan.hasNext())
		{
			System.err.println("Nothing in File!");
			return;
		}
		int testCases = Integer.parseInt(scan.nextLine());
		int lower;
		int upper;
		int move;
		int d;
		int total;
		int zeroes;
		int num = 1;
		int first;
		HashSet<Integer> set;
		while(scan.hasNext())
		{
			System.out.print("Case #" + num + ": ");
			total = 0;
			lower = scan.nextInt();
			upper = scan.nextInt();
			for (int x = lower; x <= (upper); x++)
			{
				set = new HashSet<Integer>();
				zeroes = 1;
				move = x;
				while (move > 9)
				{
					move = move/10;
					zeroes = zeroes * 10;
				}
				int limit = zeroes;
				for(int n = 10; n < (limit*10); n = n * 10)
				{

					move = x/n;
					d = x % n;
					d = d * zeroes;
					d = d + move;
					zeroes = zeroes / 10;
					if (d < x && d >= lower && !set.contains(d) && d > 9)
					{
						total++;
						//System.out.println(d + " , " + x);
						set.add(d);
					}
				}
			}
			num++;
			System.out.print(total);
			if (scan.hasNext())
			{
				System.out.println();				
			}
		}
	}

}
