
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 mgg.problems;

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

import mgg.utils.FileUtil;
import mgg.utils.Pair;
import mgg.utils.StringUtils;

/**
 * @author manolo
 * @date 14/04/12
 */
public class ProblemC {

	public final static String EXAMPLE_IN = "C-example.in";
	public final static String EXAMPLE_OUT = "C-example.out";

	public final static String C_SMALL_IN = "C-small-attempt0.in";
	public final static String C_SMALL_OUT = "C-small-attempt0.out";

	public final static String C_LARGE_IN= "C-large-practice.in";
	public final static String C_LARGE_OUT = "C-large-practice.out";

	public final static String delim = " ";

	public static String solve(FileUtil util) {

		String line = util.getLine();
		List<Integer> listOfArgs = StringUtils.stringWithIntegersToList(line, delim);

		final int A = listOfArgs.get(0);
		System.out.println("\tA = " + A);

		final int B = listOfArgs.get(1);
		System.out.println("\tB = " + B);

		//ArrayList<Pair> solution = new ArrayList<Pair>();
		int found = 0;
		for(int i = A; i < B ; i++){
			for(int j = A + 1; j <= B ; j++){
				if(i<j){
					if(recicled(i, j)){
						found++;//solution.add(new Pair(i, j));
					}
				}
			}
		}

		//System.out.println("Solution: " + solution);
		System.out.println("Found: " + found);

		return "" + found;
	}

	private static boolean recicled(int n, int m) {

		int numCiphers = numCiphers(n);

		//System.out.println("n: " + n + "(" + numCiphers + ")");

		for(int i = 0; i < numCiphers; i++){
			int aux_n = moveCiphersToFront(n, i, numCiphers);
			//System.out.println("aux_n: " + aux_n);
			
			if(aux_n == m){
				return true;
			}
		}

		return false;
	}

	private static int numCiphers(int n) {
		int result = 0;
		while(n > 0){
			n = n / 10;
			result++;
		}
		return result;
	}

	private static int moveCiphersToFront(int number, int howManyCiphers, int numCiphers) {
		String num = "" + number;

		String newNumber = num.substring(numCiphers-howManyCiphers, numCiphers) +
		num.substring(0, numCiphers-howManyCiphers);

		//System.out.println("new number: " + newNumber);

		return Integer.parseInt(newNumber);
	}

}
