
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 hk.polyu.cslhu.codejam.solution.impl.qualificationround;

import java.util.List;

import hk.polyu.cslhu.codejam.solution.Solution;

public class RecycledNumbers extends Solution {
	private int min, max;
	
	@Override
	public void setProblem(List<String> problemDesc) {
		// TODO Auto-generated method stub
		String[] splitArray = problemDesc.get(0).split(" ");
		this.min = Integer.valueOf(splitArray[0]);
		this.max = Integer.valueOf(splitArray[1]);
	}

	@Override
	public void solve() {
		// TODO Auto-generated method stub
		int numOfPairs = 0;
		
		for (int i = this.min; i < this.max; i++) {
			for (int j = i + 1; j <= this.max; j++) {
				if (this.isRecycledPair(i, j))
					numOfPairs++;
			}
		}
		
		this.result = String.valueOf(numOfPairs);
	}

	private boolean isRecycledPair(int i, int j) {
		// TODO Auto-generated method stub
		
		if (i >= j)
			return false;
		
		String m = String.valueOf(j);
		String n = String.valueOf(i);
		
		for (int startIndex = 1; startIndex < n.length(); startIndex++) {
			String partToMove = n.substring(startIndex, n.length());
			String newString = partToMove + n.substring(0, startIndex);
			
			if (newString.equals(m))
				return true;
		}
		
		return false;
	}

}
