
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 com.codegem.zaidansari;

import java.io.BufferedWriter;
import java.io.File;
import java.io.FileNotFoundException;
import java.io.FileReader;
import java.io.FileWriter;
import java.io.IOException;
import java.util.ArrayList;
import java.util.List;
import java.util.Scanner;

public class CodeGemUtil {

    public static List<String> getInputValues(File file) {
        List<String> inputData = new ArrayList<String>();
        if (!file.exists()) { throw new RuntimeException("File not fould:" + file.getAbsolutePath()); }
        try {
            Scanner scanner = new Scanner(new FileReader(file));
            while (scanner.hasNextLine()) {
                inputData.add(scanner.nextLine());
            }

        } catch (FileNotFoundException e) {
            System.out.println("Failed to find file :" + file);
        }

        return inputData;
    }

    public static boolean createOutputFile(List<String> outputData, String fileName) {
        File folderName = new File("/Users/zaansari/Desktop/CodeGem2012/OutputFiles/");
        File outputFile = new File(folderName, fileName);
        try {
            BufferedWriter writer = new BufferedWriter(new FileWriter(outputFile));
            int count = 0;
            for (String outputDatum : outputData) {
                writer.write("Case #" + (++count) + ": ");
                writer.write(outputDatum);
                writer.newLine();
            }
            writer.close();
            return true;
        } catch (IOException e) {
            System.out.println("Failed to write file :" + outputFile + ", Error Message:" + e.getMessage());
        }
        // Failed to wrirte file return false;
        return false;
    }

    public static void main(String[] args) {
        File file = new File("/Users/zaansari/Desktop/CodeGem2012/InputFiles/codeGem.in.txt");
        List<String> inputData = CodeGemUtil.getInputValues(file);
        for (String inputDatum : inputData) {
            System.out.println(inputDatum);
        }


        boolean createdOutputFile = CodeGemUtil.createOutputFile(inputData, "Q2Small.txt");
        if (createdOutputFile) {
            System.out.println("Successfully created output file");
        } else {
            System.out.println("Failed to create output file");
        }
    }
}
