
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.jagsaund.codejam.qualifcation;

import java.util.HashMap;
import java.util.HashSet;
import java.util.Iterator;
import java.util.Map;
import java.util.Set;
import java.util.StringTokenizer;

public class RecycledNumbers {
  public RecycledNumbers() {
    
  }
  
  public String run(String line) {
    int m;
    int n;
    
    StringTokenizer tokenizer = new StringTokenizer(line);
    
    n = Integer.parseInt(tokenizer.nextToken());
    m = Integer.parseInt(tokenizer.nextToken());
    
    Map<Integer, Set<Integer>> map = new HashMap<Integer, Set<Integer>>();
    
    for (int i=0; i<=(m-n); i++) {
      String value = Integer.toString((i+n));
//      System.out.println("current value: " + value);
      
      if (!map.containsKey((i+n))) {
        map.put((i+n), new HashSet<Integer>());
      }
      
      for(int j=1; j<value.length(); j++) {
        value = value.substring(1) + value.charAt(0);
//        System.out.println("rotated value: " + value);
        
        int rotatedNumber = Integer.parseInt(value);
        
        if (rotatedNumber >= n && rotatedNumber <= m && rotatedNumber != (i+n)) {
          if (map.containsKey(rotatedNumber)) {
            
          } else {
            Set<Integer> set = map.get((i+n));
            set.add(rotatedNumber);
            map.put((i+n), set);
            
//            System.out.println("Added: " + rotatedNumber);
//            System.out.println("Current pairs: " + set.size());
          }
        }
    
      }
    }
    
    int count = 0;
    Set<Integer> keys = map.keySet();
    for (Iterator<Integer> it = keys.iterator(); it.hasNext();) {
      count += map.get(it.next()).size();
    }
    
    return count + "";
  }
}
