
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 net.nickball.gcj.qual.recyclednumbers;

import java.io.*;
import java.util.HashSet;
import java.util.Set;
import org.apache.commons.lang3.StringUtils;

/**
 *
 * @author nick
 */
public class RecycledNumbers {

    /**
     * @param args the command line arguments
     */
    public static void main(String[] args) {
        BufferedReader reader = null;
        try {
            if(args.length != 2) 
                throw new IllegalArgumentException("Usage: RecycledNumbers <inputfile> <outputfile>");
            File inputFile = new File(args[0]);
            if (! inputFile.exists()) throw new FileNotFoundException("File not found! File: "+ args[0]);
            
            reader = new BufferedReader(new FileReader(inputFile));
            String cases = reader.readLine();
            
            String line;
            int caseCounter = 1; 
            while((line = reader.readLine()) != null) {
                String[] parts = line.split(" ");
                int A = Integer.parseInt(parts[0]);
                int B = Integer.parseInt(parts[1]);
                System.out.println("Case #" + caseCounter + ": " + getRecycledPairs(A,B));
                caseCounter++;
            }
            
        } catch(Exception e) {
            e.printStackTrace();
            System.exit(255);
        } finally {
            try {
                if(reader != null) reader.close();
            } catch(IOException e) {
                e.printStackTrace();
            } 
        }
    }

    private static long getRecycledPairs(int A, int B) {
        long count = 0;
        Set<String> uniques = new HashSet<String>(); 
        for(int n = A; n <=B; n++) {
            String nStr = Integer.toString(n);
            
            for(int m = n+1; m <=B; m++) {
                String mStr = Integer.toString(m);
                if(mStr.length() > nStr.length()) break;
                
                for(int index = 1; index < nStr.length(); index++) {
                    String start = new StringBuffer(nStr.substring(0,index)).reverse().toString();
                    String end = new StringBuffer(nStr.substring(index)).reverse().toString();
                    String rotated = StringUtils.stripStart(new StringBuffer(start).append(end).reverse().toString(),"0");
                    
                    //System.out.println(start +"," + end + "," + rotated);
                    if(rotated.equals(mStr) && (! uniques.contains(n + "" + m))) {
                        //System.out.println(n + "," + m);
                        uniques.add(n + "" + m);
                        count++;
                    }
                }
                
            }
        }
        return count;
    }
}
