
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 hk.polyu.cslhu.codejam;

import java.util.ArrayList;
import java.util.List;

import org.apache.log4j.Logger;

import hk.polyu.cslhu.codejam.lib.FileStream;
import hk.polyu.cslhu.codejam.lib.ResultCollector;
import hk.polyu.cslhu.codejam.solution.Solution;
import hk.polyu.cslhu.codejam.solution.impl.StoreCredit;
import hk.polyu.cslhu.codejam.solution.impl.qualificationround.DancingWithTheGooglers;
import hk.polyu.cslhu.codejam.solution.impl.qualificationround.RecycledNumbers;
import hk.polyu.cslhu.codejam.solution.impl.qualificationround.SpeakingInTongues;
import hk.polyu.cslhu.codejam.thread.JamThreadManager;

/**
 * Hello world!
 *
 */
public class App 
{
	public static Logger logger = Logger.getLogger(App.class);
	
	public List<List<String>> getTestCaseList(String filePath) {
		List<List<String>> testCaseList = new ArrayList<List<String>>();
		List<String> content = FileStream.read(filePath);
		logger.info("The amount of lines: " + content.size());
		logger.info("The amount of test cases: " + content.get(0));
		
		for (int i = 1; i < content.size(); i++)
			testCaseList.add(content.subList(i, i + 1));
		
		return testCaseList;
	}
	
    public static void main( String[] args )
    {
    	String filePath = "C:\\Users\\Allen HU\\Dropbox\\Misc\\C-small-attempt1.in";
    	String resultFile = filePath + ".result";
    	String resultPattern = "Case #" + ResultCollector.IndexPartInRow + ": " + ResultCollector.ResultPartInRow + "\n";
    	boolean allowMultiThreads = false;
    	
    	List<List<String>> testCaseList = new App().getTestCaseList(filePath);
    	
    	Solution solution = new RecycledNumbers();
    	
        JamThreadManager jtm = new JamThreadManager(solution, testCaseList, resultFile, resultPattern, allowMultiThreads);
        try {
			jtm.runThreads();
		} catch (CloneNotSupportedException e) {
			// TODO Auto-generated catch block
			e.printStackTrace();
		}
    }
}
