
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 codejam.recycled_numbers;

import java.io.IOException;
import java.util.ArrayList;
import codejam.filestuff.FileStuff;

public class RecycledNumbers {
	
	public static void main(String[] args) throws IOException {
		FileStuff fs = new FileStuff("C-small-attempt0.in","C-small.out","recycled_numbers");
		ArrayList<String> input = new ArrayList<String>();
		input = fs.ReadFromFile();
		
		ArrayList<String> output = new ArrayList<String>();
		
		int xCase = Integer.valueOf(input.get(0));
		int xPointer = 1;
		
		for (int i=1;i<=xCase;i++)
		{
			String strOut = "Case #" + String.valueOf(i) + ":";
			String strLine = input.get(xPointer);
			xPointer++;
			String[] arrLine = strLine.split(" ");
			int xA = Integer.valueOf(arrLine[0]);
			int xB = Integer.valueOf(arrLine[1]);
			int xRec = 0;
			for (int a=xA;a<=xB;a++)
			{
				int xLen = String.valueOf(a).length();
				int xLimit = 1;
				for (int b=1;b<=xLen;b++) xLimit *= 10;
				if (xLimit > xB) xLimit = xB+1;
				for (int b=a+1;b<xLimit;b++)
				{
					if (RecycledNumbers.isRecycled(a, b)) xRec++;
				}
			}
			strOut += " " + String.valueOf(xRec);
			output.add(strOut);
		}
		fs.WriteToFile(output);
		System.out.print("Done!!!");
	}
	
	public static boolean isRecycled(int num1,int num2)
	{
		String str1 = String.valueOf(num1);
		String str2 = String.valueOf(num2);
		boolean boolRes = false;
		if (str1.length() == str2.length())
		{
			for (int i=1;i<str1.length();i++)
			{
				String strRec = str1.substring(i) + str1.substring(0,i);
				if (strRec.equals(str2))
				{
					boolRes = true;
					break;
				}
			}
		}
		return boolRes;
	}

}
