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

import java.io.File;
import java.io.FileNotFoundException;

/**
 *
 * @author Fidel
 */
public class qr_problemB {
    public static void main(String args[]) throws FileNotFoundException{
        File f = new File("input.txt");
        java.util.Scanner sc = new java.util.Scanner(f);
        int T = sc.nextInt();
        
        for (int i = 0; i < T; i++) {
            int A = sc.nextInt();
            int B = sc.nextInt();
            int y = 0;
            
            for (int j = A; j <= B; j++) {
                for (int k = B; k > j; k--) {
                    String a = String.valueOf(j);
                    for (int l = 1; l < String.valueOf(k).length(); l++) {
                        String b = String.valueOf(k);
                        String tmp = b.substring(b.length()-l) + b.substring(0, b.length()-l);
                        
                        if(tmp.matches(a)){
                          
                            y++;
                            break;
                        }                        
                    }
                    
                }
            }
            System.out.println("Case #" + (i+1) + ": " + y);
        }
    }
}
