
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 problemC;

import java.io.BufferedWriter;
import java.io.File;
import java.io.FileWriter;
import java.io.Writer;
import java.util.HashSet;
import java.util.Scanner;
import java.util.Set;

public class RecycledNumbers {
	
	public static void main(String[] args) throws Exception {
		
		Writer write = new FileWriter(new File("out.txt"));
		Writer writer = new BufferedWriter(write);
		
		Scanner scan = new Scanner(new File("C-small-attempt0.in.txt"));
		
		int num = scan.nextInt();
		for(int i = 1; i<=num; i++) {
			int lower = scan.nextInt();
			int upper = scan.nextInt();
			int count = 0;
			for(int j = lower; j<upper; j++) {
				Set<String> iterations = iterations(""+j);
				for(int k = j+1; k<=upper; k++) {
					String s = ""+k;
					if(iterations.contains(s)) count++;
				}
			}
			
			writer.write("Case #"+i+": "+count+"\n");
			
		}
		
		writer.close();
		write.close();
		
		
	}
	
	
	public static Set<String> iterations(String in) {
		Set<String> strings = new HashSet<String>();
		
		String current = new String(in);
		strings.add(current);
		for(int i = 0; i<current.length(); i++) {
			String start = current.substring(0, current.length()-1);
			String end = current.substring(current.length()-1);
			
			current = end+start;
			strings.add(current);
		}
		
		//System.out.println(strings);
		
		return strings;
	}

}
