
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 lt.kasrud.gcj.ex3;

import lt.kasrud.gcj.common.IO;

import java.io.IOException;
import java.util.ArrayList;
import java.util.HashSet;
import java.util.List;
import java.util.Set;

public class Main {
  public static void main(String[] args) throws IOException {
    IO.Data data = IO.readFile("C-small-attempt0.in");
    IO.writeFile("out3.txt", process(data));
  }

  private static List<Integer> process(IO.Data data) {
    List<Integer> result = new ArrayList<Integer>(data.getInt(0, 0));
    for(IO.Record r : data.getRecords(1)){
      Integer c = calculate(r.getInt(0), r.getInt(1));
      result.add(c);
    }

    return result;
  }

  private static Integer calculate(Integer a, Integer b) {
    int cnt = 0;
    Set<Integer> ms = new HashSet<Integer>();
    for (int n=a; n<=b; n++){
      ms.clear();
      String ns = String.valueOf(n);
      for (int i = 1; i< ns.length(); i++){
        int m = rotate(ns, i);
        if (m > n && m <= b){
          ms.add(m);
        }
      }
      cnt += ms.size();
    }

    return cnt;
  }

  private static int rotate(String ns, int i){
    String ms = ns.substring(i, ns.length()) + ns.substring(0, i);
    return Integer.valueOf(ms);
  }
}
